3074.Sudoku数独。。dancinglink经典题[crayon-68acd6a3a5aa4514304478/]3252.RoundNumbers简单数位dpf(i,j,x,y)表示最高的i位,0比1多j个,是否已小于n,高位是否有1然后转移显然。。。[crayon-68acd6a3a5ab6170064017/]1665.Biker'sTripOdometer阅读题[crayon-68acd6a3a5abd075981296/]1930.DeadFraction丧心病狂。。枚举循环节[crayon-68acd6a3a5ac1052790797/]1970.TheGame[crayon-68acd6a3a5ac4677147692/]1185.炮兵...
A.SoldierandBananas模拟[crayon-68acd6a3a6a3d274677621/]B.SoldierandBadges排序[crayon-68acd6a3a6a46769777374/]C.SoldierandCards暴力模拟个一百万次。。。[crayon-68acd6a3a6a4c663843415/]D.SoldierandNumberGame用筛法得出每个数质因子个数前缀和即可[crayon-68acd6a3a6a50937763731/]E.SoldierandTraveling我比较愚蠢写了网络流。。正解是什么我不知道[crayon-68acd6a3a6a55377612340/] ...
1694.AnOldStoneGamef[x]表示x为根的树至少需要的石头,把子树按f排序后贪心即可[crayon-68acd6a3aa228521701304/]poj1738.AnoldStoneGame参见discuss的神算法,据说是knuth提出的?[crayon-68acd6a3aa232060570292/]1737.ConnectedGraph跪大爷http://blog.csdn.net/PoPoQQQ/article/details/43525019[crayon-68acd6a3aa239364484436/]1742.Coins二进制拆分+bitset竟然过不了...我被题解骗了突然一想这不是以前做过...
3613.CowRelays求经过n条边的最短路,floyd+倍增QAQ[crayon-68acd6a3aa858905151037/]2728.DesertKing最优比率生成树分数规划[crayon-68acd6a3aa864485659294/]1639.PicnicPlanning带度数限制的最小生成树http://wenku.baidu.com/link?url=UKcnK1pZvaVwypQOrIFRTOPzM4edIlBmqvnZjZipGf2o_6u-aB1F2tFsMGdUQbA1O-96menmbgyxNoSoWKWBeJnr-RJKuG2yM4b6Jf7IvR3[crayon-68acd6a3aa8...
近期评论