|
|
2519 |
Z0909809
收益
|
0 / 0 |
(无) |
|
|
2528 |
Z09098099
Subset Sums
|
0 / 0 |
(无) |
|
|
36 |
Z09098100
货币面值
|
0 / 0 |
(无) |
|
|
110 |
Z090981010
Diving for Gold
|
0 / 0 |
(无) |
|
|
39 |
Z0909901
多重背包（一）
|
0 / 0 |
(无) |
|
|
111 |
Z09099022
储钱罐
|
0 / 0 |
(无) |
|
|
43 |
Z0909903
混合背包
|
0 / 0 |
(无) |
|
|
40 |
Z0909904
多重背包-二进制优化（二）
|
0 / 0 |
(无) |
|
|
109 |
Z09099044
Buying Hay S
|
0 / 0 |
(无) |
|
|
45 |
Z0909905
均分魔法石
|
0 / 0 |
(无) |
|
|
42 |
Z0909906
庆功会
|
0 / 0 |
(无) |
|
|
112 |
Z09099066
吃蛋糕
|
0 / 0 |
(无) |
|
|
29 |
Z0909907
砝码称重
|
0 / 0 |
(无) |
|
|
80 |
Z0909908
摆花
|
0 / 0 |
(无) |
|
|
44 |
Z0909909
太空电梯
|
0 / 0 |
(无) |
|
|
46 |
Z0909910
忙碌
|
0 / 0 |
(无) |
|
|
57 |
Z0910000
精卫填海
|
0 / 0 |
(无) |
|
|
47 |
Z0910001
分组背包
|
0 / 0 |
(无) |
|
|
48 |
Z0910002
二维费用背包
|
0 / 0 |
(无) |
|
|
54 |
Z0910003
潜水员
|
0 / 0 |
(无) |
|
|
35 |
Z0910004
金明的预算方案
|
0 / 0 |
(无) |
|
|
49 |
Z0910005
游戏项目
|
0 / 0 |
(无) |
|
|
50 |
Z0910006
L 国的战斗之间谍
|
0 / 0 |
(无) |
|
|
51 |
Z0910007
NOIP
|
0 / 0 |
(无) |
|
|
52 |
Z0910008
三角形牧场
|
0 / 0 |
(无) |
|
|
53 |
Z0910009
铺放线段
|
0 / 0 |
(无) |
|
|
55 |
Z0910010
宠物小精灵之收服
|
0 / 0 |
(无) |
|
|
103 |
Z0910101
越越的组队
|
0 / 0 |
(无) |
|
|
104 |
Z0910102
最大购物优惠
|
0 / 0 |
(无) |
|
|
105 |
Z0910103
纪念品
|
0 / 0 |
(无) |
|
|
28 |
Z0910104
货币系统
|
0 / 0 |
(无) |
|
|
106 |
Z0910105
费用报销
|
0 / 0 |
(无) |
|
|
107 |
Z0910106
River Crossing S
|
0 / 0 |
(无) |
|
|
108 |
Z0910107
音量调节
|
0 / 0 |
(无) |
|
|
41 |
Z0910108
科技庄园
|
0 / 0 |
(无) |
|
|
31 |
Z0910109
邮票面值设计
|
0 / 0 |
(无) |
|
|
25 |
Z0910110
飞扬的小鸟
|
0 / 0 |
(无) |
|
|
81 |
Z0910201
最长上升子序列(LIS)
|
0 / 0 |
(无) |
|
|
82 |
Z0910202
最长公共子序列一(LCS)
|
0 / 0 |
(无) |
|
|
84 |
Z0910203
最长公共子串（一）
|
0 / 0 |
(无) |
|
|
86 |
Z0910204
最长递增子序列的个数
|
0 / 0 |
(无) |
|
|
87 |
Z0910205
最长公共子序列二（LCS）
|
0 / 0 |
(无) |
|
|
85 |
Z0910206
最长公共子串（二）
|
0 / 0 |
(无) |
|
|
88 |
Z0910207
最少的修改次数
|
0 / 0 |
(无) |
|
|
83 |
Z0910208
最长公共子序列三(LCS)
|
0 / 0 |
(无) |
|
|
122 |
Z0910209
最长公共子串（三）
|
0 / 0 |
(无) |
|
|
89 |
Z0910210
最长上升公共子序列
|
0 / 0 |
(无) |
|
|
90 |
Z0910301
编辑距离
|
0 / 0 |
(无) |
|
|
91 |
Z0910302
友好城市
|
0 / 0 |
(无) |
|
|
92 |
Z0910303
不相交的线
|
0 / 0 |
(无) |
|
|
34 |
Z0910304
合唱队形
|
0 / 0 |
(无) |
|
|
93 |
Z0910305
登山
|
0 / 0 |
(无) |
|
|
94 |
Z0910306
围栏木桩
|
0 / 0 |
(无) |
|
|
95 |
Z0910307
大朋友的数字
|
0 / 0 |
(无) |
|
|
96 |
Z0910308
怪盗基德的滑翔翼
|
0 / 0 |
(无) |
|
|
97 |
Z0910309
低价购买
|
0 / 0 |
(无) |
|
|
30 |
Z0910310
拦截导弹（二）
|
0 / 0 |
(无) |
|
|
58 |
Z0910601
合并石子
|
0 / 0 |
(无) |
|
|
61 |
Z0910602
石子合并（环形一）
|
0 / 0 |
(无) |
|
|
69 |
Z0910603
回文字串
|
0 / 0 |
(无) |
|
|
63 |
Z0910604
删数
|
0 / 0 |
(无) |
|
|
60 |
Z09106044
石子合并（二）
|
0 / 0 |
(无) |
|
|
59 |
Z09106055
石子合并（环形二）
|
0 / 0 |
(无) |
|
|
62 |
Z0910606
能量项链
|
0 / 0 |
(无) |
|
|
66 |
Z0910607
合唱队
|
0 / 0 |
(无) |
|
|
70 |
Z0910608
释放囚犯
|
0 / 0 |
(无) |
|
|
115 |
Z0910609
Treats for the Cows G/S
|
0 / 0 |
(无) |
|
|
113 |
Z0910610
关路灯
|
0 / 0 |
(无) |
|
|
71 |
Z0910701
正则括号序列
|
0 / 0 |
(无) |
|
|
33 |
Z0910702
数字游戏
|
0 / 0 |
(无) |
|
|
117 |
Z0910703
机器分配
|
0 / 0 |
(无) |
|
|
27 |
Z0910704
合并饭团
|
0 / 0 |
(无) |
|
|
65 |
Z0910705
涂色
|
0 / 0 |
(无) |
|
|
24 |
Z0910706
Platinum 262144
|
0 / 0 |
(无) |
|
|
116 |
Z09107066
262144 P
|
0 / 0 |
(无) |
|
|
32 |
Z0910707
乘积最大
|
0 / 0 |
(无) |
|
|
118 |
Z0910708
248 G
|
0 / 0 |
(无) |
|
|
64 |
Z0910709
山区建小学
|
0 / 0 |
(无) |
|
|
114 |
Z0910710
Cheapest Palindrome G
|
0 / 0 |
(无) |
|
|
37 |
Z1010901
ST 表
|
0 / 0 |
(无) |
|
|
38 |
Z1010902
最大值
|
0 / 0 |
(无) |
|
|
56 |
Z1011201
最小生成树-Prim算法
|
0 / 0 |
(无) |
|
|
121 |
Z1011202
最小生成树-Kruskal算法
|
0 / 0 |
(无) |
|
|
76 |
Z1011203
Watering Hole G
|
0 / 1 |
10 |
|
|
74 |
Z1011204
最短网络
|
0 / 0 |
(无) |
|
|
78 |
Z1011205
局域网
|
0 / 0 |
(无) |
|
|
120 |
Z1011206
道路建设
|
0 / 0 |
(无) |
|
|
119 |
Z1011207
Building Roads S
|
0 / 0 |
(无) |
|
|
102 |
Z1011208
隧道建设
|
0 / 0 |
(无) |
|
|
68 |
Z1011209
买礼物
|
0 / 0 |
(无) |
|
|
72 |
Z1011210
丛林之路
|
0 / 0 |
(无) |
|
|
77 |
Z1011301
Out of Hay S
|
0 / 0 |
(无) |
|
|
26 |
Z1011303
货车运输
|
0 / 0 |
(无) |
|
|
75 |
Z1011304
聪明的猴子
|
0 / 0 |
(无) |
|
|
67 |
Z1011306
最小差值生成树
|
0 / 0 |
(无) |
|
|
73 |
Z1011401
有向图的单源最短路径-Dijkstra
|
0 / 0 |
(无) |
|
|
100 |
Z1011402
有负权边的最短路
|
0 / 0 |
(无) |
|
|
79 |
Z1011403
单源最短路径-Dijkstra优化
|
0 / 0 |
(无) |
|
|
98 |
Z1011404
网络延迟时间
|
0 / 0 |
(无) |
|
|
99 |
Z1011405
最短距离和路径问题
|
0 / 0 |
(无) |
