http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-67eeeaf637c63095050654/]树状数组过线段树不过[crayon-67eeeaf637c6c691803846/]线段树求最大数[crayon-67eeeaf637c70381110488/]关键词搜索[crayon-67eeeaf637c77707173801/]旅行最短路[crayon-67eeeaf637c84762620193/]强连通分量[crayon-67eeeaf637c90033209824/]统计不同子串[crayon-67eeeaf637c9b926083983/]匹配网络流模板[crayon-67eeeaf637ca8205233950/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-67eeeaf638570573761850/]POJ2112OptimalMilking[crayon-67eeeaf63857f791033299/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-67eeeaf638588580918537/]POJ1269IntersectingLines[crayon-67eeeaf63858f320102812/]POJ1569MyacmTriangles[crayon-67eeeaf638593984905936/]POJ1039Pipe[crayon-67eeeaf638...
题目来源:http://dapractise.openjudge.cn/2019hwall/多模式串字符串匹配模板题AC自动机模板题[crayon-67eeeaf638e87043006222/]POJ3987ComputerVirusonPlanetPandora[crayon-67eeeaf638e94283535363/]躲不开的病毒找自动机上的环[crayon-67eeeaf638e9d939776618/]POJ3691DNArepairDP,考虑前i个字符且停留在trie树上编号为j的节点时,字符串所修改的最小次数[crayon-67eeeaf638eb3767954446/]POJ3450Corpor...
题目来源:http://dapractise.openjudge.cn/2019hwall/冰阔落I[crayon-67eeeaf63a087749391859/]POJ1182食物链[crayon-67eeeaf63a090906799963/]POJ2492ABug'sLife[crayon-67eeeaf63a096840836462/]POJ3321AppleTree树状数组维护dfs序[crayon-67eeeaf63a09a119613261/]POJ1195Mobilephones[crayon-67eeeaf63a0a1591071768/]不好做的最长上升子序列[crayon-67eeeaf63a0a5285807887/]POJ2182DifficultLostC...
近期评论