http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-64808038408a2824106031/]树状数组过线段树不过[crayon-64808038408ad432093481/]线段树求最大数[crayon-64808038408b1219557880/]关键词搜索[crayon-64808038408b7988702645/]旅行最短路[crayon-64808038408be328606743/]强连通分量[crayon-64808038408c5722938772/]统计不同子串[crayon-64808038408cb537308227/]匹配网络流模板[crayon-64808038408dd901108205/]线性...
A.SquareandRectangles模拟题[crayon-64808038442ee727988482/]B.StadiumandGames\[(2^k-1)m+m(m-1)/2=n\]枚举k二分得出m[crayon-64808038442f6941635769/]C.MonstersandDiamonds此题比较恶心QAQ求最短用个类似dijkstra的东西,如果一种u->{v}的转移所有mn[v]都确定了,把这个转移放进堆或者是某个转移的代价被更新了求最长用记忆化搜索,走出环就是inf[crayon-64808038442fb458361062/]D.Reclamation把图扩展成r...
3613.CowRelays求经过n条边的最短路,floyd+倍增QAQ[crayon-6480803844b6f385204037/]2728.DesertKing最优比率生成树分数规划[crayon-6480803844b7a835592192/]1639.PicnicPlanning带度数限制的最小生成树http://wenku.baidu.com/link?url=UKcnK1pZvaVwypQOrIFRTOPzM4edIlBmqvnZjZipGf2o_6u-aB1F2tFsMGdUQbA1O-96menmbgyxNoSoWKWBeJnr-RJKuG2yM4b6Jf7IvR3[crayon-6480803844b...
poj2245.Lotto裸搜索[crayon-64808038451b8123897867/]poj2601.Simplecalculations推公式麻烦。。直接二分[crayon-64808038451c5523065343/]poj1635.Subwaytreesystems树的同构,哈希[crayon-64808038451cd235241200/]poj2419.Forests暴力即可[crayon-64808038451d4982523283/]poj1717.Dominoesdp水题[crayon-64808038451da954395132/]poj2949.WordRings建图+分数规划[crayon-64808038451e0574474310/] ...
近期评论