
A.DowntheHatch!阅读+模拟题[crayon-694a44b876a16041810794/]B.MaximumAbsurdity每K个的和求出来以后,就是找距离超过K的两个数相加的最大值[crayon-694a44b876a1f904831624/]C.Students'Revengehttp://m.blog.csdn.net/blog/u010638776/10044315[crayon-694a44b876a25003514991/]D.TheftofBlueprintswmd神犇:http://blog.csdn.net/wmdcstdio/article/details/44755115[crayon-694a44b876a2a631879482/]E.Binary...
![「CF325X」MemSQL start[c] up Round 1](http://hzwer.com/wp-content/themes/ly/image/image_post/2014-12-10_12-58-01.jpg)
A.SquareandRectangles模拟题[crayon-694a44b877c24240383189/]B.StadiumandGames\[(2^k-1)m+m(m-1)/2=n\]枚举k二分得出m[crayon-694a44b877c30008260070/]C.MonstersandDiamonds此题比较恶心QAQ求最短用个类似dijkstra的东西,如果一种u->{v}的转移所有mn[v]都确定了,把这个转移放进堆或者是某个转移的代价被更新了求最长用记忆化搜索,走出环就是inf[crayon-694a44b877c37948826747/]D.Reclamation把图扩展成r...

1379.RunAway模拟退火裸题[crayon-694a44b88cd3d638689088/]2758.CheckingtheText暴力+哈希[crayon-694a44b88cd4d241859564/]poj3156.Interconnect由于状态是满足拓扑序的,所以直接dp上,再用个hash记忆化[crayon-694a44b88cd57469642098/]1837.Balancef(i,j)前i个力矩为j的方案,dp[crayon-694a44b88cd60371284760/]3609.ResetSequence状压+bfs初始集合是0-n-1每个指令会使得集合中的一些元素消失,目标状态是只有一个0[c...
近期评论