|
|
131 |
F0125
#102. 最小费用流
|
0 / 0 |
(无) |
|
|
133 |
F0127
#116. 有源汇有上下界最大流
|
0 / 0 |
(无) |
|
|
162 |
F0156
#2042. 「CQOI2016」不同的最小割
|
0 / 0 |
(无) |
|
|
250 |
F0244
#6000. 「网络流 24 题」搭配飞行员
|
0 / 0 |
(无) |
|
|
251 |
F0245
#6005. 「网络流 24 题」最长递增子序列
|
0 / 0 |
(无) |
|
|
252 |
F0246
#6007. 「网络流 24 题」方格取数
|
0 / 0 |
(无) |
|
|
253 |
F0247
#6008. 「网络流 24 题」餐巾计划
|
0 / 0 |
(无) |
|
|
255 |
F0249
#6010. 「网络流 24 题」数字梯形
|
0 / 0 |
(无) |
|
|
256 |
F0250
#6011. 「网络流 24 题」运输问题
|
0 / 0 |
(无) |
|
|
257 |
F0251
#6012. 「网络流 24 题」分配问题
|
0 / 0 |
(无) |
|
|
258 |
F0252
#6013. 「网络流 24 题」负载平衡
|
0 / 0 |
(无) |
|
|
259 |
F0253
#6014. 「网络流 24 题」最长 k 可重区间集
|
0 / 0 |
(无) |
|
|
260 |
F0254
#6015. 「网络流 24 题」星际转移
|
0 / 0 |
(无) |
|
|
301 |
F0295
#6224. 「网络流 24 题」深海机器人问题
|
0 / 0 |
(无) |
|
|
302 |
F0296
#6226. 「网络流 24 题」骑士共存问题
|
0 / 0 |
(无) |
|
|
303 |
F0297
#6227. 「网络流 24 题」最长k可重线段集问题
|
0 / 0 |
(无) |
|
|
726 |
F0720
Four Melodies
|
0 / 0 |
9 |
|
|
748 |
F0742
Two Melodies
|
0 / 0 |
9 |
|
|
768 |
F0762
Card Game
|
0 / 0 |
8 |
|
|
824 |
F0818
Oleg and chess
|
0 / 0 |
10 |
|
|
835 |
F0829
Evacuation
|
0 / 0 |
8 |
|
|
1064 |
F1058
Goods transportation
|
0 / 0 |
10 |
|
|
1080 |
F1074
Cactusophobia
|
0 / 0 |
8 |
|
|
1091 |
F1085
Underfail
|
0 / 0 |
8 |
|
|
1368 |
F1362
World Evil
|
0 / 0 |
9 |
|
|
1375 |
F1369
Bear and Fair Set
|
0 / 0 |
9 |
|
|
1764 |
F1758
Scaygerboss
|
0 / 0 |
9 |
|
|
1765 |
F1759
Scaygerboss
|
0 / 0 |
9 |
|
|
1815 |
F1809
Array and Operations
|
0 / 0 |
7 |
|
|
1946 |
F1940
Flow Optimality
|
0 / 0 |
10 |
|
|
2026 |
F2020
Nanami's Power Plant
|
0 / 0 |
10 |
|
|
2273 |
F2267
Petya and Pipes
|
0 / 0 |
8 |
|
|
2398 |
F2392
Ciel and Duel
|
0 / 0 |
6 |
|
|
2423 |
F2417
Tidying Up
|
0 / 0 |
8 |
|
|
2424 |
F2418
Tidying Up
|
0 / 0 |
7 |
|
|
2441 |
F2435
Biologist
|
0 / 0 |
8 |
|
|
2532 |
F2526
k-Maximum Subsequence Sum
|
0 / 0 |
9 |
|
|
2661 |
F2655
Build String
|
0 / 0 |
6 |
|
|
2704 |
F2698
Planar Graph
|
0 / 0 |
10 |
图灵 OJTURING / ONLINE JUDGE