http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-68e910b0e4b9d555695748/]树状数组过线段树不过[crayon-68e910b0e4ba9213960781/]线段树求最大数[crayon-68e910b0e4bad514022963/]关键词搜索[crayon-68e910b0e4bb2339255697/]旅行最短路[crayon-68e910b0e4bba170282593/]强连通分量[crayon-68e910b0e4bc1500384470/]统计不同子串[crayon-68e910b0e4bc7739356516/]匹配网络流模板[crayon-68e910b0e4bd3264121823/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/冰阔落I[crayon-68e910b0e6dd1604571113/]POJ1182食物链[crayon-68e910b0e6ddf271686230/]POJ2492ABug'sLife[crayon-68e910b0e6de7505874562/]POJ3321AppleTree树状数组维护dfs序[crayon-68e910b0e6dec376478908/]POJ1195Mobilephones[crayon-68e910b0e6df2070907114/]不好做的最长上升子序列[crayon-68e910b0e6df6325626219/]POJ2182DifficultLostC...
A.HelpfulMaths排序[crayon-68e910b0eb022249326042/]B.XeniaandRingroad题意即题解[crayon-68e910b0eb02f646402015/]C.XeniaandWeights搜索可过[crayon-68e910b0eb037006170895/]D.XeniaandBitOperations线段树模拟每次询问可以自底向上修改[crayon-68e910b0eb03f690583565/]E.ThreeSwaps由于只有三次交换,所以数列最多被分成七段找到所有断点爆搜[crayon-68e910b0eb049947531904/] ...
近期评论