|
P1000 水题 RP+87
|
41 |
39 |
5 |
|
P1002 路 RP+84
|
72 |
26 |
6 |
|
P1003 小C的密室 RP+94
|
81 |
9 |
8 |
|
P1004 A.以撒 RP+97
|
15 |
20 |
9 |
|
P1005 B.scy的删边问题 RP+90
|
56 |
21 |
7 |
|
P1006 C、团伙 RP+88
|
47 |
30 |
6 |
|
P1007 D、家谱 RP+94
|
30 |
23 |
7 |
|
P1008 A题：最小生成树 RP+84
|
67 |
30 |
6 |
|
P1009 B题 RP+100
|
8 |
0 |
10 |
|
P1010 B题:最小生成树 RP+84
|
155 |
12 |
8 |
|
P1012 神奇的操作 RP+84
|
90 |
22 |
7 |
|
P1013 神题 RP+92
|
57 |
16 |
7 |
|
P1014 灾后重建 RP+87
|
69 |
23 |
7 |
|
P1015 小球(drop) RP+84
|
60 |
33 |
5 |
|
P1016 二叉树遍历(flist) RP+87
|
61 |
26 |
6 |
|
P1017 FBI树(fbi) RP+87
|
35 |
43 |
5 |
|
P1018 二叉树输出(btout) RP+92
|
26 |
35 |
6 |
|
P1019 查找二叉树(tree_a) RP+87
|
51 |
31 |
6 |
|
P1020 对称二叉树(tree_c) RP+90
|
83 |
14 |
8 |
|
P1021 合并果子(fruit) RP+88
|
41 |
34 |
5 |
|
P1022 最小函数值(minval) RP+90
|
39 |
31 |
6 |
|
P1024 鱼塘钓鱼（fishing） RP+92
|
13 |
69 |
7 |
|
P1025 表达式 RP+95
|
40 |
15 |
8 |
|
P1026 反应力考验 RP+88
|
33 |
42 |
5 |
|
P1027 森林大礼包 RP+91
|
33 |
33 |
6 |
|
P1028 跑步 RP+96
|
43 |
12 |
8 |
|
P1030 次芝麻 RP+89
|
112 |
12 |
8 |
|
P1031 安全事件 RP+93
|
122 |
7 |
9 |
|
P1032 天才的记忆 RP+85
|
81 |
22 |
7 |
|
P1033 卡丁车 RP+88
|
126 |
11 |
8 |
|
P1034 斐波那契 RP+87
|
43 |
37 |
5 |
|
P1035 扩散 RP+90
|
18 |
67 |
6 |
|
P1036 过路费 RP+90
|
75 |
16 |
7 |
|
P1037 路径数 RP+96
|
48 |
8 |
8 |
|
P1038 0/1背包 RP+89
|
34 |
38 |
5 |
|
P1039 采药 RP+87
|
18 |
83 |
5 |
|
P1040 装箱问题(pack.pas/c/cpp) RP+90
|
28 |
43 |
5 |
|
P1041 金明的预算方案(budget.pas/c/cpp) RP+92
|
13 |
69 |
7 |
|
P1042 拦截导弹（Noip1999） RP+92
|
31 |
29 |
6 |
|
P1043 友好城市 RP+91
|
28 |
36 |
6 |
|
P1044 合唱队形 RP+91
|
25 |
44 |
5 |
|
P1045 最长不下降子序列 RP+94
|
57 |
12 |
8 |
|
P1046 序列 (sequence) RP+85
|
27 |
67 |
3 |
|
P1047 最大子段和 （maxsum） RP+90
|
64 |
19 |
7 |
|
P1048 最小差值生成树 (mdt) RP+91
|
33 |
30 |
6 |
|
P1049 火车 (train) RP+96
|
50 |
10 |
8 |
|
P1054 Substring Counting RP+98
|
2 |
100 |
9 |
|
P1055 Circuit Measurement RP+99
|
1 |
100 |
9 |
|
P1056 Division Query RP+99
|
1 |
100 |
9 |
|
P1057 Similar String RP+99
|
1 |
100 |
9 |
|
P1058 Manuscript Review RP+98
|
4 |
50 |
9 |
|
P1059 Big Money RP+98
|
3 |
67 |
9 |
|
bucket RP+92
|
85 |
11 |
8 |
|
report RP+97
|
18 |
17 |
9 |
|
dispatch RP+96
|
38 |
13 |
8 |
|
sapling RP+87
|
189 |
8 |
8 |
|
conflict RP+98
|
5 |
40 |
9 |
|
number RP+97
|
12 |
25 |
9 |
|
transport RP+97
|
24 |
12 |
8 |
|
robot RP+91
|
153 |
7 |
9 |
|
count RP+97
|
12 |
25 |
9 |
|
sequence RP+84
|
180 |
11 |
8 |
|
Iota Extraction RP+88
|
70 |
20 |
7 |
|
17.10.5 Prob I - Showtime RP+91
|
68 |
15 |
8 |
|
17.10.5 Prob II - Flip RP+97
|
41 |
7 |
9 |
|
17.10.5 Prob III - Security RP+96
|
48 |
10 |
8 |
|
17.10.6 Prob I - Median RP+96
|
29 |
14 |
8 |
|
17.10.6 Prob II - Coin RP+99
|
19 |
5 |
9 |
|
17.10.6 Prob III - Function RP+98
|
9 |
22 |
9 |
|
Team Queue RP+99
|
1 |
100 |
9 |
|
Moving Chess RP+87
|
238 |
6 |
9 |
|
Placing Apples RP+75
|
156 |
21 |
7 |
|
DFS练习 - 最短路（小规模数据） RP+92
|
48 |
19 |
7 |
|
图结构练习 - 邻接表 RP+87
|
78 |
21 |
7 |
|
图结构练习 - 最短路（大规模数据） RP+87
|
98 |
16 |
7 |
|
Repair Road RP+100
|
4 |
0 |
10 |
|
Basic STL I RP+84
|
66 |
29 |
6 |
|
Basic STL II RP+85
|
44 |
41 |
4 |
|
Basic Binary Search RP+91
|
91 |
12 |
8 |
|
Point Coverage RP+89
|
43 |
30 |
6 |
|
Refund Arrangement RP+99
|
4 |
25 |
9 |
|
Query on Points RP+89
|
100 |
13 |
8 |
|
Report (Simple Ver.) RP+87
|
155 |
10 |
8 |
|
Decimal RP+95
|
45 |
13 |
8 |
|
Basic BFS RP+89
|
66 |
20 |
7 |
|
Tempter of the Bone RP+90
|
284 |
4 |
9 |
|
Basic Knapsack RP+87
|
314 |
5 |
9 |
|
Time Machine RP+92
|
77 |
12 |
8 |
|
Placing Stones RP+91
|
166 |
7 |
9 |
|
Basic Knapsack II RP+88
|
228 |
6 |
9 |
|
Sequence Partition RP+96
|
127 |
3 |
9 |
|
Interview RP+99
|
1 |
100 |
9 |
|
NP Knapsack RP+86
|
232 |
7 |
9 |
|
Basic Binary Indexed Tree RP+86
|
273 |
6 |
9 |
|
Median of Queue RP+91
|
170 |
6 |
9 |
|
Riichi Ranklist RP+90
|
43 |
28 |
6 |
|
Limited Purchase RP+97
|
53 |
6 |
9 |
|
Interval Counter RP+99
|
20 |
5 |
9 |
|
Malicious Arrangement RP+94
|
167 |
4 |
9 |
|
2019.2.10 Problem A - vol RP+81
|
41 |
56 |
3 |