http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-6767afdee02e2654852790/]树状数组过线段树不过[crayon-6767afdee02ef905105408/]线段树求最大数[crayon-6767afdee02f3705129854/]关键词搜索[crayon-6767afdee02f9573262163/]旅行最短路[crayon-6767afdee0300870325106/]强连通分量[crayon-6767afdee0307412814060/]统计不同子串[crayon-6767afdee030e983276241/]匹配网络流模板[crayon-6767afdee031a237599672/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-6767afdee17ec222996751/]POJ2112OptimalMilking[crayon-6767afdee17fc189259867/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-6767afdee1805236169791/]POJ1269IntersectingLines[crayon-6767afdee180b146756348/]POJ1569MyacmTriangles[crayon-6767afdee180f003394120/]POJ1039Pipe[crayon-6767afdee1...
poj1961Periodkmp求出fail数组后,前i个的重复子串就是i-fail(i)[crayon-6767afdf03994029470229/]poj1276 CashMachine用f(i,j)表示前i种面值,达到j的面值和,所需要的第i种钞票的最少数量[crayon-6767afdf0399e235968968/]poj1702 Eva'sBalance先把n转为3进制,若p位为2,就在左盘放3^p,进位若p位为1,就在右盘放3^p[crayon-6767afdf039a4949186469/]poj1273 DrainageDitches大名鼎鼎的草地排水,网络流模板[crayon-6...
近期评论