| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 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 |
Hi guys! Can you help me please with some problem I found recently? http://acm.timus.ru/problem.aspx?space=1&num=1099
I think it'a a maximum flow problem, but I can't figure out how to solve it. Some say something about Flower Trees, but I don't actually know what they are. Thanks in advance! :)
It's a maximum matching problem on a general graph. See Edmonds' Blossom algorithm
Thanks a lot! It's very helpfull. Do you also have some implementation of it?
The following is my implementation. https://github.com/boleynsu/acmicpc-codes/blob/master/archives/problemset/acm.timus.ru/1099.cpp
Thanks!