
A.SoldierandBananas模拟[crayon-69242d101baa9067982303/]B.SoldierandBadges排序[crayon-69242d101bab6873190499/]C.SoldierandCards暴力模拟个一百万次。。。[crayon-69242d101babe341855323/]D.SoldierandNumberGame用筛法得出每个数质因子个数前缀和即可[crayon-69242d101bac5185917176/]E.SoldierandTraveling我比较愚蠢写了网络流。。正解是什么我不知道[crayon-69242d101bace195006766/] ...

1694.AnOldStoneGamef[x]表示x为根的树至少需要的石头,把子树按f排序后贪心即可[crayon-69242d101df37530672926/]poj1738.AnoldStoneGame参见discuss的神算法,据说是knuth提出的?[crayon-69242d101df46839126897/]1737.ConnectedGraph跪大爷http://blog.csdn.net/PoPoQQQ/article/details/43525019[crayon-69242d101df65976995069/]1742.Coins二进制拆分+bitset竟然过不了...我被题解骗了突然一想这不是以前做过...

A.AmrandMusic排序贪心[crayon-69242d101e8d6786990157/]B.AmrandPins算出距离除以直径[crayon-69242d101e8e4139720777/]C.GuessYourWayOut!按位考虑[crayon-69242d101e8eb437273202/]D.TheMathsLecture从后往前dpf(i,j,k)表示后i位,当前模为j,是否有后缀被K整除[crayon-69242d101e8f3902796754/]E.BreakingGood广搜,选可用边最多的路径[crayon-69242d101e908436555930/] ...
近期评论