
http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-68f8dc87e85e6523087153/]树状数组过线段树不过[crayon-68f8dc87e85f2806511589/]线段树求最大数[crayon-68f8dc87e85f6388030317/]关键词搜索[crayon-68f8dc87e85fb301279883/]旅行最短路[crayon-68f8dc87e8603214442859/]强连通分量[crayon-68f8dc87e8609282995227/]统计不同子串[crayon-68f8dc87e8610867770526/]匹配网络流模板[crayon-68f8dc87e861c837520768/]线性...

题目来源:http://dapractise.openjudge.cn/2019hwall/冰阔落I[crayon-68f8dc87ea1fa053233294/]POJ1182食物链[crayon-68f8dc87ea204557453992/]POJ2492ABug'sLife[crayon-68f8dc87ea20a173413694/]POJ3321AppleTree树状数组维护dfs序[crayon-68f8dc87ea20e380302465/]POJ1195Mobilephones[crayon-68f8dc87ea214786105887/]不好做的最长上升子序列[crayon-68f8dc87ea218500337671/]POJ2182DifficultLostC...

A.HelpfulMaths排序[crayon-68f8dc87ede99274722846/]B.XeniaandRingroad题意即题解[crayon-68f8dc87edea2176668985/]C.XeniaandWeights搜索可过[crayon-68f8dc87edea6150051066/]D.XeniaandBitOperations线段树模拟每次询问可以自底向上修改[crayon-68f8dc87edeaa097413632/]E.ThreeSwaps由于只有三次交换,所以数列最多被分成七段找到所有断点爆搜[crayon-68f8dc87edeaf553384933/] ...
近期评论