| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | pajenegod | 145 |
| 9 | SecondThread | 145 |
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!