http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-68b8f5aaac849335582721/]树状数组过线段树不过[crayon-68b8f5aaac854262051817/]线段树求最大数[crayon-68b8f5aaac858078888091/]关键词搜索[crayon-68b8f5aaac85e909290447/]旅行最短路[crayon-68b8f5aaac86d566142755/]强连通分量[crayon-68b8f5aaac874189525181/]统计不同子串[crayon-68b8f5aaac87b696214549/]匹配网络流模板[crayon-68b8f5aaac887957097127/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/冰阔落I[crayon-68b8f5aaae388907865555/]POJ1182食物链[crayon-68b8f5aaae391798842002/]POJ2492ABug'sLife[crayon-68b8f5aaae397392838117/]POJ3321AppleTree树状数组维护dfs序[crayon-68b8f5aaae39c706596313/]POJ1195Mobilephones[crayon-68b8f5aaae3a2911629947/]不好做的最长上升子序列[crayon-68b8f5aaae3a6075182658/]POJ2182DifficultLostC...
A.HelpfulMaths排序[crayon-68b8f5aab1802183751610/]B.XeniaandRingroad题意即题解[crayon-68b8f5aab180b402458888/]C.XeniaandWeights搜索可过[crayon-68b8f5aab180f617999583/]D.XeniaandBitOperations线段树模拟每次询问可以自底向上修改[crayon-68b8f5aab1813416826274/]E.ThreeSwaps由于只有三次交换,所以数列最多被分成七段找到所有断点爆搜[crayon-68b8f5aab1818115737796/] ...
近期评论