A.SoldierandBananas模拟[crayon-68635ba3b9e8d114211469/]B.SoldierandBadges排序[crayon-68635ba3b9e95107450644/]C.SoldierandCards暴力模拟个一百万次。。。[crayon-68635ba3b9e9a630355865/]D.SoldierandNumberGame用筛法得出每个数质因子个数前缀和即可[crayon-68635ba3b9e9d083676340/]E.SoldierandTraveling我比较愚蠢写了网络流。。正解是什么我不知道[crayon-68635ba3b9ea2955419983/] ...
1694.AnOldStoneGamef[x]表示x为根的树至少需要的石头,把子树按f排序后贪心即可[crayon-68635ba3bb531817307918/]poj1738.AnoldStoneGame参见discuss的神算法,据说是knuth提出的?[crayon-68635ba3bb53b772156597/]1737.ConnectedGraph跪大爷http://blog.csdn.net/PoPoQQQ/article/details/43525019[crayon-68635ba3bb542860798227/]1742.Coins二进制拆分+bitset竟然过不了...我被题解骗了突然一想这不是以前做过...
A.AmrandMusic排序贪心[crayon-68635ba3bbaee671701867/]B.AmrandPins算出距离除以直径[crayon-68635ba3bbaf8391366137/]C.GuessYourWayOut!按位考虑[crayon-68635ba3bbafc407096970/]D.TheMathsLecture从后往前dpf(i,j,k)表示后i位,当前模为j,是否有后缀被K整除[crayon-68635ba3bbb01040878730/]E.BreakingGood广搜,选可用边最多的路径[crayon-68635ba3bbb07960465288/] ...
近期评论