A.DowntheHatch!阅读+模拟题[crayon-688bddda7a44d831247507/]B.MaximumAbsurdity每K个的和求出来以后,就是找距离超过K的两个数相加的最大值[crayon-688bddda7a457281245731/]C.Students'Revengehttp://m.blog.csdn.net/blog/u010638776/10044315[crayon-688bddda7a45d051914618/]D.TheftofBlueprintswmd神犇:http://blog.csdn.net/wmdcstdio/article/details/44755115[crayon-688bddda7a462591843945/]E.Binary...
A.HelpfulMaths排序[crayon-688bddda7b220074068410/]B.XeniaandRingroad题意即题解[crayon-688bddda7b229797316659/]C.XeniaandWeights搜索可过[crayon-688bddda7b234537294259/]D.XeniaandBitOperations线段树模拟每次询问可以自底向上修改[crayon-688bddda7b239273370808/]E.ThreeSwaps由于只有三次交换,所以数列最多被分成七段找到所有断点爆搜[crayon-688bddda7b23e259556993/] ...
A.SquareandRectangles模拟题[crayon-688bddda7cb50024506028/]B.StadiumandGames\[(2^k-1)m+m(m-1)/2=n\]枚举k二分得出m[crayon-688bddda7cb59566442827/]C.MonstersandDiamonds此题比较恶心QAQ求最短用个类似dijkstra的东西,如果一种u->{v}的转移所有mn[v]都确定了,把这个转移放进堆或者是某个转移的代价被更新了求最长用记忆化搜索,走出环就是inf[crayon-688bddda7cb60175407523/]D.Reclamation把图扩展成r...
近期评论