http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-681d768e80a4e986021016/]树状数组过线段树不过[crayon-681d768e80a5a516057553/]线段树求最大数[crayon-681d768e80a5e069771704/]关键词搜索[crayon-681d768e80a64608319112/]旅行最短路[crayon-681d768e80a6b392661394/]强连通分量[crayon-681d768e80a72500481408/]统计不同子串[crayon-681d768e80a79569571478/]匹配网络流模板[crayon-681d768e80a8c434376389/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/冰阔落I[crayon-681d768e82675795402994/]POJ1182食物链[crayon-681d768e82680309204224/]POJ2492ABug'sLife[crayon-681d768e82686015056204/]POJ3321AppleTree树状数组维护dfs序[crayon-681d768e8268a604358771/]POJ1195Mobilephones[crayon-681d768e82690103339534/]不好做的最长上升子序列[crayon-681d768e82694455427641/]POJ2182DifficultLostC...
A.HelpfulMaths排序[crayon-681d768e85d02400374958/]B.XeniaandRingroad题意即题解[crayon-681d768e85d0b283704106/]C.XeniaandWeights搜索可过[crayon-681d768e85d10489385059/]D.XeniaandBitOperations线段树模拟每次询问可以自底向上修改[crayon-681d768e85d14753859865/]E.ThreeSwaps由于只有三次交换,所以数列最多被分成七段找到所有断点爆搜[crayon-681d768e85d27468003563/] ...
近期评论