http://dapractise.openjudge.cn/2019finalexam2/排队[crayon-681d763c9fc70610864878/]树状数组过线段树不过[crayon-681d763c9fc7b460995241/]线段树求最大数[crayon-681d763c9fc80550138772/]关键词搜索[crayon-681d763c9fc85813430639/]旅行最短路[crayon-681d763c9fc8d945688110/]强连通分量[crayon-681d763c9fc93407023026/]统计不同子串[crayon-681d763c9fc9a065315470/]匹配网络流模板[crayon-681d763c9fca6717151120/]线性...
题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-681d763ca1139724972047/]POJ2112OptimalMilking[crayon-681d763ca1148184943442/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-681d763ca1151241197999/]POJ1269IntersectingLines[crayon-681d763ca1158267101851/]POJ1569MyacmTriangles[crayon-681d763ca115b818533488/]POJ1039Pipe[crayon-681d763ca1...
poj1961Periodkmp求出fail数组后,前i个的重复子串就是i-fail(i)[crayon-681d763cb61db533456649/]poj1276 CashMachine用f(i,j)表示前i种面值,达到j的面值和,所需要的第i种钞票的最少数量[crayon-681d763cb61e4133331667/]poj1702 Eva'sBalance先把n转为3进制,若p位为2,就在左盘放3^p,进位若p位为1,就在右盘放3^p[crayon-681d763cb61ea361051408/]poj1273 DrainageDitches大名鼎鼎的草地排水,网络流模板[crayon-6...
近期评论