https://blog.youkuaiyun.com/Merlininicezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Merlininice/article/details/38132673https://blog.youkuaiyun.com/Merlininice/article/details/38132673MerlininiceFri, 25 Jul 2014 23:48:14 +0800https://blog.youkuaiyun.com/Merlininice/article/details/27509971https://blog.youkuaiyun.com/Merlininice/article/details/27509971MerlininiceThu, 29 May 2014 11:43:08 +0800maxdist，最大分支单独分一块，这样一直算知道最大+次大 hard 数位dp。 Fibonacc]]>https://blog.youkuaiyun.com/Merlininice/article/details/25674687https://blog.youkuaiyun.com/Merlininice/article/details/25674687MerlininiceTue, 13 May 2014 07:28:01 +0800https://blog.youkuaiyun.com/Merlininice/article/details/25520025https://blog.youkuaiyun.com/Merlininice/article/details/25520025MerlininiceSun, 11 May 2014 02:44:16 +0800https://blog.youkuaiyun.com/Merlininice/article/details/25091349https://blog.youkuaiyun.com/Merlininice/article/details/25091349MerlininiceTue, 06 May 2014 04:39:28 +0800 lose，否则的话判断堆数奇偶即可（堆数==1要特判） medium： 树形dp，dp[i][j]，表示以i为根的子树分配完成，并且i节点会j技能的最小花费。 转移：枚举i点在自己的department所用的技能(k)，然后]]>https://blog.youkuaiyun.com/Merlininice/article/details/25013643https://blog.youkuaiyun.com/Merlininice/article/details/25013643MerlininiceMon, 05 May 2014 02:20:56 +0800https://blog.youkuaiyun.com/Merlininice/article/details/24947869https://blog.youkuaiyun.com/Merlininice/article/details/24947869MerlininiceSun, 04 May 2014 03:14:09 +0800https://blog.youkuaiyun.com/Merlininice/article/details/24921199https://blog.youkuaiyun.com/Merlininice/article/details/24921199MerlininiceSat, 03 May 2014 15:41:51 +0800https://blog.youkuaiyun.com/Merlininice/article/details/24744931https://blog.youkuaiyun.com/Merlininice/article/details/24744931MerlininiceTue, 29 Apr 2014 23:41:39 +0800https://blog.youkuaiyun.com/Merlininice/article/details/24743139https://blog.youkuaiyun.com/Merlininice/article/details/24743139MerlininiceTue, 29 Apr 2014 22:56:19 +0800https://blog.youkuaiyun.com/Merlininice/article/details/24384211https://blog.youkuaiyun.com/Merlininice/article/details/24384211MerlininiceThu, 24 Apr 2014 13:08:56 +0800https://blog.youkuaiyun.com/Merlininice/article/details/21873449https://blog.youkuaiyun.com/Merlininice/article/details/21873449MerlininiceTue, 25 Mar 2014 23:54:53 +0800https://blog.youkuaiyun.com/Merlininice/article/details/21493467https://blog.youkuaiyun.com/Merlininice/article/details/21493467MerlininiceWed, 19 Mar 2014 01:32:23 +0800https://blog.youkuaiyun.com/Merlininice/article/details/20304577https://blog.youkuaiyun.com/Merlininice/article/details/20304577MerlininiceSun, 02 Mar 2014 20:26:01 +0800https://blog.youkuaiyun.com/Merlininice/article/details/19492639https://blog.youkuaiyun.com/Merlininice/article/details/19492639MerlininiceWed, 19 Feb 2014 16:25:45 +0800 i -> T 然后S到i边为100，i到T边为100，割左边意思是这个格子的#属于竖着的，右边表示横着的 （为什么选100。。。额，最后还要减去，为了S到i和i到T两条边只被割一条） 如果选的竖着的（i到T的边没被割），那么如果这个格子上面一格不是#，那么要额外花费1的，选横着同理。 如果i在j上面，那么如果i选横的（割右边]]>https://blog.youkuaiyun.com/Merlininice/article/details/19475301https://blog.youkuaiyun.com/Merlininice/article/details/19475301MerlininiceWed, 19 Feb 2014 09:45:34 +0800https://blog.youkuaiyun.com/Merlininice/article/details/18996011https://blog.youkuaiyun.com/Merlininice/article/details/18996011MerlininiceSat, 08 Feb 2014 22:36:49 +0800https://blog.youkuaiyun.com/Merlininice/article/details/18976821https://blog.youkuaiyun.com/Merlininice/article/details/18976821MerlininiceSat, 08 Feb 2014 02:16:29 +0800https://blog.youkuaiyun.com/Merlininice/article/details/18919921https://blog.youkuaiyun.com/Merlininice/article/details/18919921MerlininiceTue, 04 Feb 2014 05:27:42 +0800https://blog.youkuaiyun.com/Merlininice/article/details/18913309https://blog.youkuaiyun.com/Merlininice/article/details/18913309MerlininiceMon, 03 Feb 2014 22:42:32 +0800