http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-681e0f9a8f49f874091046/]树状数组过线段树不过[crayon-681e0f9a8f4a8441962977/]线段树求最大数[crayon-681e0f9a8f4ac837777727/]关键词搜索[crayon-681e0f9a8f4b2602034154/]旅行最短路[crayon-681e0f9a8f4b9546652430/]强连通分量[crayon-681e0f9a8f4c0678934615/]统计不同子串[crayon-681e0f9a8f4c7391753349/]匹配网络流模板[crayon-681e0f9a8f4d3474994055/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-681e0f9a8fdb2713028479/]POJ2112OptimalMilking[crayon-681e0f9a8fdc2709282075/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-681e0f9a8fdcb294801339/]POJ1269IntersectingLines[crayon-681e0f9a8fdd2776102619/]POJ1569MyacmTriangles[crayon-681e0f9a8fdd6316876236/]POJ1039Pipe[crayon-681e0f9a8f...
题目来源:http://dapractise.openjudge.cn/2019hwall/多模式串字符串匹配模板题AC自动机模板题[crayon-681e0f9a90692981332443/]POJ3987ComputerVirusonPlanetPandora[crayon-681e0f9a9069e713463215/]躲不开的病毒找自动机上的环[crayon-681e0f9a906a7269241182/]POJ3691DNArepairDP,考虑前i个字符且停留在trie树上编号为j的节点时,字符串所修改的最小次数[crayon-681e0f9a906af002167093/]POJ3450Corpor...
题目来源:http://dapractise.openjudge.cn/2019hwall/冰阔落I[crayon-681e0f9a91a3a897536754/]POJ1182食物链[crayon-681e0f9a91a43383391774/]POJ2492ABug'sLife[crayon-681e0f9a91a49014630981/]POJ3321AppleTree树状数组维护dfs序[crayon-681e0f9a91a4e384815044/]POJ1195Mobilephones[crayon-681e0f9a91a55060140183/]不好做的最长上升子序列[crayon-681e0f9a91a59715377344/]POJ2182DifficultLostC...
近期评论