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