http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-66a45db73059a998371003/]树状数组过线段树不过[crayon-66a45db7305a6255328180/]线段树求最大数[crayon-66a45db7305ab058359226/]关键词搜索[crayon-66a45db7305b0433796046/]旅行最短路[crayon-66a45db7305b8859260902/]强连通分量[crayon-66a45db7305be510279128/]统计不同子串[crayon-66a45db7305c5715342595/]匹配网络流模板[crayon-66a45db7305d1660731646/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-66a45db733a2d944570391/]POJ2112OptimalMilking[crayon-66a45db733a3c230341364/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-66a45db733a47379373548/]POJ1269IntersectingLines[crayon-66a45db733a4e515795854/]POJ1569MyacmTriangles[crayon-66a45db733a54738082183/]POJ1039Pipe[crayon-66a45db733...
poj1961Periodkmp求出fail数组后,前i个的重复子串就是i-fail(i)[crayon-66a45db7669ab543052378/]poj1276 CashMachine用f(i,j)表示前i种面值,达到j的面值和,所需要的第i种钞票的最少数量[crayon-66a45db7669b5280696153/]poj1702 Eva'sBalance先把n转为3进制,若p位为2,就在左盘放3^p,进位若p位为1,就在右盘放3^p[crayon-66a45db7669bb253203611/]poj1273 DrainageDitches大名鼎鼎的草地排水,网络流模板[crayon-6...
近期评论