http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-662ce1f4343a3899324997/]树状数组过线段树不过[crayon-662ce1f4343b4351851443/]线段树求最大数[crayon-662ce1f4343bc066247617/]关键词搜索[crayon-662ce1f4343c2814096939/]旅行最短路[crayon-662ce1f4343c9566067811/]强连通分量[crayon-662ce1f4343d0983914441/]统计不同子串[crayon-662ce1f4343d7208445225/]匹配网络流模板[crayon-662ce1f4343e3925406643/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/冰阔落I[crayon-662ce1f436000441077094/]POJ1182食物链[crayon-662ce1f43600a386309484/]POJ2492ABug'sLife[crayon-662ce1f436010709561970/]POJ3321AppleTree树状数组维护dfs序[crayon-662ce1f436015740800182/]POJ1195Mobilephones[crayon-662ce1f43601b554063945/]不好做的最长上升子序列[crayon-662ce1f43601f267481435/]POJ2182DifficultLostC...
A.HelpfulMaths排序[crayon-662ce1f439519330039261/]B.XeniaandRingroad题意即题解[crayon-662ce1f439526897738662/]C.XeniaandWeights搜索可过[crayon-662ce1f43952f520849196/]D.XeniaandBitOperations线段树模拟每次询问可以自底向上修改[crayon-662ce1f439536454604598/]E.ThreeSwaps由于只有三次交换,所以数列最多被分成七段找到所有断点爆搜[crayon-662ce1f43953f871968619/] ...
近期评论