http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-6867163624d95060433347/]树状数组过线段树不过[crayon-6867163624d9f882141064/]线段树求最大数[crayon-6867163624da4525245573/]关键词搜索[crayon-6867163624da9447353565/]旅行最短路[crayon-6867163624db1929434840/]强连通分量[crayon-6867163624dbe486936275/]统计不同子串[crayon-6867163624dc5808134028/]匹配网络流模板[crayon-6867163624dd1183995327/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/冰阔落I[crayon-68671636268bb037427850/]POJ1182食物链[crayon-68671636268c4506213387/]POJ2492ABug'sLife[crayon-68671636268ca455103125/]POJ3321AppleTree树状数组维护dfs序[crayon-68671636268ce706411486/]POJ1195Mobilephones[crayon-68671636268d5015690246/]不好做的最长上升子序列[crayon-68671636268d9714510629/]POJ2182DifficultLostC...
A.HelpfulMaths排序[crayon-6867163629cb1059727143/]B.XeniaandRingroad题意即题解[crayon-6867163629cba721251617/]C.XeniaandWeights搜索可过[crayon-6867163629cbe584436589/]D.XeniaandBitOperations线段树模拟每次询问可以自底向上修改[crayon-6867163629cc2942429599/]E.ThreeSwaps由于只有三次交换,所以数列最多被分成七段找到所有断点爆搜[crayon-6867163629cc7248797396/] ...
近期评论