http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-68ab581549afd542669822/]树状数组过线段树不过[crayon-68ab581549b07880088810/]线段树求最大数[crayon-68ab581549b0c687595723/]关键词搜索[crayon-68ab581549b11031378488/]旅行最短路[crayon-68ab581549b1b578323422/]强连通分量[crayon-68ab581549b22765423173/]统计不同子串[crayon-68ab581549b2b951321319/]匹配网络流模板[crayon-68ab581549b37234718592/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-68ab58154a480350094897/]POJ2112OptimalMilking[crayon-68ab58154a498935837672/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-68ab58154a4ac715955110/]POJ1269IntersectingLines[crayon-68ab58154a4b7514211487/]POJ1569MyacmTriangles[crayon-68ab58154a4c1646981565/]POJ1039Pipe[crayon-68ab58154a...
题目来源:http://dapractise.openjudge.cn/2019hwall/多模式串字符串匹配模板题AC自动机模板题[crayon-68ab58154af1b103283576/]POJ3987ComputerVirusonPlanetPandora[crayon-68ab58154af2f535503325/]躲不开的病毒找自动机上的环[crayon-68ab58154af3f967191732/]POJ3691DNArepairDP,考虑前i个字符且停留在trie树上编号为j的节点时,字符串所修改的最小次数[crayon-68ab58154af4d491327284/]POJ3450Corpor...
题目来源:http://dapractise.openjudge.cn/2019hwall/冰阔落I[crayon-68ab58154c4d3472192902/]POJ1182食物链[crayon-68ab58154c4e1518159027/]POJ2492ABug'sLife[crayon-68ab58154c4eb792645304/]POJ3321AppleTree树状数组维护dfs序[crayon-68ab58154c4f3410971780/]POJ1195Mobilephones[crayon-68ab58154c4fe436225257/]不好做的最长上升子序列[crayon-68ab58154c506824449796/]POJ2182DifficultLostC...
近期评论