# | User | Rating |
---|---|---|
1 | jiangly | 4039 |
2 | tourist | 3841 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3590 |
5 | ecnerwala | 3542 |
6 | Benq | 3535 |
7 | orzdevinwang | 3526 |
8 | gamegame | 3477 |
9 | heuristica | 3357 |
10 | Radewoosh | 3355 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 165 |
3 | Um_nik | 160 |
3 | atcoder_official | 160 |
5 | djm03178 | 158 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 151 |
8 | awoo | 151 |
10 | TheScrasse | 146 |
Name |
---|
Auto comment: topic has been updated by err0r (previous revision, new revision, compare).
2014-2015 ACM-ICPC, Asia Xian Regional Contest, problem C is a really good problem related to min cut. Also check out these problems: 1, 2, 3.
Another suggestion would be learning minimum cost flow problem, because a lot of problems can be modeled like that.
thank you ^_^
can you suggest some problems related to mincost as well? .
What's the idea for Xian Regional Contest, problem C?
Since this was necro'd, I'll use this opportunity to recommend 724E - Goods transportation