http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-68c81eea7f47d254702027/]树状数组过线段树不过[crayon-68c81eea7f486067667490/]线段树求最大数[crayon-68c81eea7f48b933227750/]关键词搜索[crayon-68c81eea7f490655616170/]旅行最短路[crayon-68c81eea7f498552281231/]强连通分量[crayon-68c81eea7f49f690162968/]统计不同子串[crayon-68c81eea7f4a6510544069/]匹配网络流模板[crayon-68c81eea7f4b2790123704/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-68c81eea808c0727779606/]POJ2112OptimalMilking[crayon-68c81eea808d2776939740/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-68c81eea808dc036713346/]POJ1269IntersectingLines[crayon-68c81eea808e3475893882/]POJ1569MyacmTriangles[crayon-68c81eea808e6203395853/]POJ1039Pipe[crayon-68c81eea80...
题目来源:http://dapractise.openjudge.cn/2019hwall/多模式串字符串匹配模板题AC自动机模板题[crayon-68c81eea8121d894080634/]POJ3987ComputerVirusonPlanetPandora[crayon-68c81eea81229173642734/]躲不开的病毒找自动机上的环[crayon-68c81eea81234474062960/]POJ3691DNArepairDP,考虑前i个字符且停留在trie树上编号为j的节点时,字符串所修改的最小次数[crayon-68c81eea8123d221298612/]POJ3450Corpor...
近期评论