|
|
1091 |
P1912
0x20搜索（0x26广搜变形：优先队列BFS）例题1：[UVA11367] Full Tank?
|
24 / 50 |
4 |
|
|
1103 |
P1924
0x20搜索（练习）6：[USACO09NOV] The Chivalrous Cow B
|
20 / 49 |
5 |
|
|
1133 |
P1954
*【归并排序：逆序对】奇数码问题
|
37 / 87 |
4 |
|
|
1267 |
P1973
*【模拟（难度：7）】数列编辑器[hdu4699]
|
34 / 119 |
6 |
|
|
1274 |
P1979
E12*【单调队列】长度不超过m的最大连续子段
|
68 / 305 |
7 |
|
|
1294 |
P1995
0x10基本数据结构（练习）2：表达式计算4
|
17 / 34 |
4 |
|
|
1297 |
P1998
[USACO08OCT] Building A Fence G
|
27 / 37 |
1 |
|
|
1309 |
P2011
[USACO08OCT] Wheel Rotation G
|
25 / 52 |
4 |
|
|
1310 |
P2012
0x30数学知识（0x33 同余）例题1：最幸运的数字[POJ3696]
|
21 / 93 |
7 |
|
|
415 |
P2025
*【容斥原理】[CF451E] Devu and Flowers
|
15 / 27 |
4 |
|
|
432 |
P2042
0x30数学知识（练习）13：守卫者的挑战[CH3B13]
|
11 / 14 |
7 |
|
|
1317 |
P2045
*【博弈SG】魔法珠
|
13 / 39 |
6 |
|
|
1318 |
P2046
[USACO08JAN] Running S
|
15 / 21 |
4 |
|
|
1322 |
P2050
[USACO08JAN] Haybale Guessing G
|
40 / 66 |
2 |
|
|
1359 |
P2087
*【动态规划：区间二维一边推】最长公共上升子序列
|
51 / 163 |
6 |
|
|
1365 |
P2093
(已测)0x50 动态规划（0x52 背包）例题1：数字组合
|
45 / 76 |
2 |
|
|
1410 |
P2137
0x50 动态规划（练习）12：【UVA10559】 方块消除 Blocks
|
17 / 36 |
5 |
|
|
1420 |
P2147
0x50 动态规划（练习）22：最大子矩阵
|
21 / 31 |
3 |
|
|
1423 |
P2150
E58*【四边形优化DP】邮局 [IOI2000]（加强版）
|
17 / 29 |
4 |
|
|
1427 |
P2154
0x50 动态规划（练习）29：P10963 Islands and Bridges
|
15 / 48 |
6 |
|
|
1432 |
P2159
D110【模板】【最短路：floyd求最小环】[CEOI 1999] Sightseeing trip
|
40 / 165 |
7 |
|
|
1433 |
P2160
[USACO07DEC] Best Cow Line G
|
23 / 71 |
6 |
|
|
1439 |
P2166
*【树形DP：树的直径】树网的核[NOIP提高组2007]
|
25 / 192 |
8 |
|
|
1445 |
P2172
E79 树上背包 [P1270] “访问”美术馆
|
20 / 99 |
7 |
|
|
1446 |
P2173
E79 树上背包 [P3360] 偷天换日
|
25 / 76 |
6 |
|
|
1448 |
P2175
[USACO07OCT] Super Paintball G
|
21 / 71 |
6 |
|
|
1452 |
P2178
*【缩点】加边+统计割边[POJ3694]网络（好题）
|
34 / 262 |
8 |
|
|
1457 |
P2183
*【拓扑综合（难度：9）】北大ACM队的远足
|
22 / 116 |
8 |
|
|
1497 |
P2223
*【最小费用流】回家[POJ2195]
|
21 / 67 |
6 |
|
|
1499 |
P2225
0x60图论（练习）28：排版幻灯片
|
15 / 41 |
6 |
|
|
1503 |
P2229
[USACO09OPEN] Bovine Embroidery G
|
9 / 12 |
8 |
|
|
1512 |
P2238
逆序对数列
|
2 / 7 |
10 |
|
|
1522 |
P2248
[GDKOI2023 普及组]城市建设
|
4 / 97 |
9 |
|
|
1526 |
P2252
[GDKOI2023 普及组]Macaron 黄
|
13 / 192 |
9 |
|
|
1536 |
P2262
*【最短路+DP】矩阵逃离
|
21 / 74 |
6 |
|
|
1568 |
P2284
[USACO11JAN] Bottleneck G
|
1 / 2 |
10 |
|
|
1571 |
P2287
*【最短路：dijkstra算法】单源最短路[USACO09OPEN] Hide and Seek S
|
34 / 163 |
7 |
|
|
1577 |
P2293
*【最短路】出发点到两点的最短距离[USACO10DEC] Apple Delivery S
|
19 / 55 |
6 |
|
|
1584 |
P2300
*【贪心】牛抢座位[USACO10OCT] Dinner Time S
|
26 / 186 |
8 |
|
|
1679 |
P2314
【计算几何：半平面交】[USACO10MAR] StarCowraft G
|
4 / 13 |
9 |
|
|
1694 |
P2321
*【并查集】判断两点是否连通[USACO10JAN] Tea Time S
|
24 / 29 |
1 |
|
|
1735 |
P2333
[USACO09NOV] A Coin Game S
|
5 / 10 |
9 |
|
|
1738 |
P2336
[USACO09NOV] Lights G
|
4 / 15 |
9 |
|
|
1806 |
P2387
[USACO09HOL] Holiday Painting G
|
1 / 4 |
10 |
|
|
1824 |
P2405
*【状态压缩DP】涂抹果酱
|
3 / 6 |
10 |
|
|
1833 |
P2414
*【最短路】[BalticOI 2002] 双调路径
|
8 / 31 |
7 |
|
|
1842 |
P2423
CLB的切糕（cake）
|
0 / 2 |
10 |
|
|
1863 |
P2444
*【欧拉路径（难度：8）】几笔画问题[Ant Trip]
|
3 / 5 |
10 |
|
|
1864 |
P2445
[USACO07MAR] Face The Right Way G
|
2 / 4 |
10 |
|
|
1873 |
P2454
E47 单调队列优化DP [POI 2004] 旅行问题
|
4 / 11 |
9 |
|
|
1883 |
P2463
*【割点】求两点之间的割点[ZJOI2004] 嗅探器
|
26 / 105 |
7 |
|
|
1885 |
P2465
*【割点】求删点后连通块的数目[CTUOpen2004]电力
|
14 / 86 |
8 |
|
|
1892 |
P2472
*【动态规划】书的复制
|
14 / 26 |
5 |
|
|
1903 |
P2479
倍数子串（timestr）
|
6 / 11 |
9 |
|
|
1904 |
P2480
六形棋（chess）
|
4 / 8 |
10 |
|
|
1905 |
P2481
糖果共享（share）
|
6 / 9 |
9 |
|
|
1906 |
P2482
参数拟合（min）
|
1 / 2 |
10 |
|
|
1910 |
P2486
[USACO07JAN] Problem Solving G
|
7 / 13 |
8 |
|
|
1911 |
P2487
[USACO07JAN] Cow School G
|
0 / 0 |
(无) |
|
|
1912 |
P2488
[USACO06DEC] Cow Picnic S
|
2 / 8 |
10 |
|
|
1913 |
P2489
[USACO06DEC] Cow Roller Coaster S
|
1 / 1 |
10 |
|
|
1914 |
P2490
[USACO06DEC] River Hopscotch S
|
1 / 1 |
10 |
|
|
1919 |
P2495
[USACO06NOV] Big Square S
|
0 / 0 |
(无) |
|
|
1920 |
P2496
0x50 动态规划（练习）28：圆形数字[USACO06NOV] Round Numbers S
|
2 / 2 |
10 |
|
|
1924 |
P2500
lemon的spj程序
|
4 / 5 |
10 |
|
|
1925 |
P2501
HUSTOJ的spj程序（1001为例）
|
3 / 3 |
10 |
|
|
1929 |
P2505
E5_2 两个排列的最长公共子序列
|
26 / 166 |
8 |
|
|
1930 |
P2506
测试程序运行时间
|
2 / 6 |
10 |
|
|
1932 |
P2508
专题负责人列表
|
2 / 2 |
10 |
|
|
1933 |
P2509
算法竞赛编程变量命名指南
|
3 / 3 |
10 |
|
|
1934 |
P2510
makedown学习
|
3 / 3 |
10 |
|
|
1941 |
P2517
[USACO06OPEN] County Fair Events S
|
0 / 0 |
(无) |
|
|
1957 |
P2533
[欧拉图]混合图欧拉回路
|
2 / 5 |
10 |
|
|
1961 |
P2537
[欧拉图]欧拉子图计数2
|
1 / 2 |
10 |
|
|
1964 |
P2540
[欧拉图]欧拉路径计数2
|
1 / 1 |
10 |
|
|
1965 |
P2541
[欧拉图]木棒
|
2 / 4 |
10 |
|
|
2024 |
P2600
E5_3 最长公共上升子序列LCIS1️⃣
|
33 / 180 |
8 |
|
|
2035 |
P2611
*【STL：deque】序列 (sequence)
|
35 / 123 |
6 |
|
|
2048 |
P2624
[USACO13OPEN] Yin and Yang G
|
6 / 68 |
9 |
|
|
2057 |
P2633
[USACO13FEB] Milk Scheduling S
|
2 / 6 |
10 |
|
|
2068 |
P2644
[USACO12DEC] Wifi Setup S
|
0 / 0 |
(无) |
|
|
2077 |
P2653
[USACO12NOV] Balanced Trees G
|
0 / 0 |
(无) |
|
|
2109 |
P2685
[USACO11NOV] Tile Exchanging S
|
1 / 4 |
10 |
|
|
2112 |
P2688
顶点赋值路径复合（Vertex Set Path Composite）
|
2 / 10 |
10 |
|
|
2134 |
P2710
排兵布阵
|
12 / 70 |
8 |
|
|
2174 |
P2750
[USACO05JAN] Sumsets S
|
0 / 0 |
(无) |
|
|
2178 |
P2754
[USACO05JAN] The Wedding Juicer G
|
0 / 1 |
10 |
|
|
2181 |
P2757
D08 [USACO04DEC] Bad Cowtractors S
|
7 / 15 |
8 |
|
|
2186 |
P2762
[USACO04OPEN] Turning in Homework G
|
0 / 0 |
(无) |
|
|
2188 |
P2764
[USACO04OPEN] Cube Stacking
|
0 / 0 |
(无) |
|
|
2194 |
P2770
[USACO04OPEN] Cave Cows 4
|
1 / 1 |
10 |
|
|
2229 |
P2805
USACO（59）线段树5：懒惰的奶牛P4876 [USACO14MAR] The Lazy Cow G
|
2 / 2 |
10 |
|
|
2247 |
P2823
USACO（77）Bellman-Ford 2：奶牛观光
|
3 / 4 |
10 |
|
|
2249 |
P2825
【最短路】领取巧克力 [USACO10FEB] Chocolate Giving S
|
11 / 19 |
6 |
|
|
2334 |
P2877
【单调队列】又买饲料[USACO10NOV] Buying Feed G
|
5 / 17 |
8 |
|
|
2612 |
P2961
[USACO05DEC] Barn Expansion G
|
4 / 7 |
10 |
|
|
2624 |
P2973
*【贪心】保护花朵[USACO07JAN] Protecting the Flowers S
|
22 / 45 |
4 |
|
|
2625 |
P2974
USACO（28）贪心进阶2：奶牛杂技[Cow Acrobats, 2005 Nov]
|
6 / 9 |
9 |
|
|
2638 |
P2987
*【搜索好题】埃及分数[USACO97Jan]Babylonian Fractions
|
3 / 8 |
10 |
|
|
2644 |
P2993
*【并查集】真话假话[USACO13JAN] Liars and Truth Tellers B
|
27 / 76 |
5 |
