http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-62c4691ee975d573177334/]树状数组过线段树不过[crayon-62c4691ee9767899360839/]线段树求最大数[crayon-62c4691ee976b088180830/]关键词搜索[crayon-62c4691ee9770567554889/]旅行最短路[crayon-62c4691ee9778535077119/]强连通分量[crayon-62c4691ee977e536977468/]统计不同子串[crayon-62c4691ee9785441013856/]匹配网络流模板[crayon-62c4691ee9791930319674/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-62c4691eea05d121430660/]POJ2112OptimalMilking[crayon-62c4691eea075365676700/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-62c4691eea085699154438/]POJ1269IntersectingLines[crayon-62c4691eea08c682946670/]POJ1569MyacmTriangles[crayon-62c4691eea090924889105/]POJ1039Pipe[crayon-62c4691eea...
题目来源:http://dapractise.openjudge.cn/2019hwall/多模式串字符串匹配模板题AC自动机模板题[crayon-62c4691eea9c5297580730/]POJ3987ComputerVirusonPlanetPandora[crayon-62c4691eea9d2221564800/]躲不开的病毒找自动机上的环[crayon-62c4691eea9db326861284/]POJ3691DNArepairDP,考虑前i个字符且停留在trie树上编号为j的节点时,字符串所修改的最小次数[crayon-62c4691eea9e3754443966/]POJ3450Corpor...
题目来源:http://dapractise.openjudge.cn/2019hwall/冰阔落I[crayon-62c4691eebb5d254466439/]POJ1182食物链[crayon-62c4691eebb66944597026/]POJ2492ABug'sLife[crayon-62c4691eebb6c080357295/]POJ3321AppleTree树状数组维护dfs序[crayon-62c4691eebb70683878405/]POJ1195Mobilephones[crayon-62c4691eebb77516561874/]不好做的最长上升子序列[crayon-62c4691eebb7b483683934/]POJ2182DifficultLostC...
近期评论