http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-67020e58b6fdb002022038/]树状数组过线段树不过[crayon-67020e58b6fe5209437551/]线段树求最大数[crayon-67020e58b6fea122376654/]关键词搜索[crayon-67020e58b6fef786766143/]旅行最短路[crayon-67020e58b6ff7552268244/]强连通分量[crayon-67020e58b6ffd001166173/]统计不同子串[crayon-67020e58b7004691599228/]匹配网络流模板[crayon-67020e58b7010983845686/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-67020e58b83c6570441981/]POJ2112OptimalMilking[crayon-67020e58b83d5677113510/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-67020e58b83df214368638/]POJ1269IntersectingLines[crayon-67020e58b83e5136728184/]POJ1569MyacmTriangles[crayon-67020e58b83e9236142116/]POJ1039Pipe[crayon-67020e58b8...
poj1961Periodkmp求出fail数组后,前i个的重复子串就是i-fail(i)[crayon-67020e58cce18164251439/]poj1276 CashMachine用f(i,j)表示前i种面值,达到j的面值和,所需要的第i种钞票的最少数量[crayon-67020e58cce21915499883/]poj1702 Eva'sBalance先把n转为3进制,若p位为2,就在左盘放3^p,进位若p位为1,就在右盘放3^p[crayon-67020e58cce27896555543/]poj1273 DrainageDitches大名鼎鼎的草地排水,网络流模板[crayon-6...
近期评论