https://blog.youkuaiyun.com/CodeOncezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/CodeOnce/article/details/53184298https://blog.youkuaiyun.com/CodeOnce/article/details/53184298CodeOnceWed, 16 Nov 2016 10:53:09 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53174953https://blog.youkuaiyun.com/CodeOnce/article/details/53174953CodeOnceTue, 15 Nov 2016 18:53:41 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53142982https://blog.youkuaiyun.com/CodeOnce/article/details/53142982CodeOnceSat, 12 Nov 2016 20:51:51 +0800= c ，建一条 b 到 a 的权值为 c 的边，求的是最长路，得到的是最小值 对于求最短路来说：①：存在负环的话是无解 ②：求不出最短路（dist[ ]没有得到更新）的话是任意解 （最长路时可以类比这两条结论）；或是1.对于一]]>https://blog.youkuaiyun.com/CodeOnce/article/details/53142900https://blog.youkuaiyun.com/CodeOnce/article/details/53142900CodeOnceSat, 12 Nov 2016 20:39:51 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53141181https://blog.youkuaiyun.com/CodeOnce/article/details/53141181CodeOnceSat, 12 Nov 2016 15:52:54 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53134618https://blog.youkuaiyun.com/CodeOnce/article/details/53134618CodeOnceFri, 11 Nov 2016 22:34:21 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53132929https://blog.youkuaiyun.com/CodeOnce/article/details/53132929CodeOnceFri, 11 Nov 2016 20:40:38 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53132854https://blog.youkuaiyun.com/CodeOnce/article/details/53132854CodeOnceFri, 11 Nov 2016 20:33:22 +0800 1） , 要么数量无限 ， 在所装物品总体积不超过V的前提下所装物品的价值的和的最大值是多少？输入]]>https://blog.youkuaiyun.com/CodeOnce/article/details/53129480https://blog.youkuaiyun.com/CodeOnce/article/details/53129480CodeOnceFri, 11 Nov 2016 15:46:09 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53129199https://blog.youkuaiyun.com/CodeOnce/article/details/53129199CodeOnceFri, 11 Nov 2016 15:22:53 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53117634https://blog.youkuaiyun.com/CodeOnce/article/details/53117634CodeOnceThu, 10 Nov 2016 17:12:25 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53116624https://blog.youkuaiyun.com/CodeOnce/article/details/53116624CodeOnceThu, 10 Nov 2016 15:58:49 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53088866https://blog.youkuaiyun.com/CodeOnce/article/details/53088866CodeOnceTue, 08 Nov 2016 21:45:24 +0800i,a[i]>a[j]，则(i,j)是一对逆序对。 给定一个数列{a}，求逆序对个数。 输入数据较大，请使用scanf代替cin读入。 *为防卡评测]]>https://blog.youkuaiyun.com/CodeOnce/article/details/53084380https://blog.youkuaiyun.com/CodeOnce/article/details/53084380CodeOnceTue, 08 Nov 2016 17:07:31 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53083322https://blog.youkuaiyun.com/CodeOnce/article/details/53083322CodeOnceTue, 08 Nov 2016 16:02:27 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53078565https://blog.youkuaiyun.com/CodeOnce/article/details/53078565CodeOnceTue, 08 Nov 2016 07:40:28 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53056774https://blog.youkuaiyun.com/CodeOnce/article/details/53056774CodeOnceSun, 06 Nov 2016 21:31:55 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53031630https://blog.youkuaiyun.com/CodeOnce/article/details/53031630CodeOnceFri, 04 Nov 2016 09:11:47 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53028332https://blog.youkuaiyun.com/CodeOnce/article/details/53028332CodeOnceThu, 03 Nov 2016 23:51:21 +0800https://blog.youkuaiyun.com/CodeOnce/article/details/53023754https://blog.youkuaiyun.com/CodeOnce/article/details/53023754CodeOnceThu, 03 Nov 2016 17:41:44 +0800