№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Название |
---|
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