| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
Problems related to general graph matching
It looks there are few problems about general graph matching in the community. And there are a few teams who solved problem B in NEERC both online and onsite.
You can find the template here and here.
The shortest code of the maximum cost matching problem is about 5.7k.
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en6 |
|
jqdai0815 | 2018-12-04 19:00:42 | 9 | Tiny change: 'ndirected weighted ' -> 'ndirected positive weighted ' | |
| en5 |
|
jqdai0815 | 2018-12-04 14:33:53 | 112 | ||
| en4 |
|
jqdai0815 | 2018-12-04 09:45:32 | 6 | Tiny change: 'SPOIL ALERT : I' -> 'SPOILER ALERT : I' | |
| en3 |
|
jqdai0815 | 2018-12-04 09:24:32 | 206 | ||
| en2 |
|
jqdai0815 | 2018-12-03 20:45:43 | 2396 | (published) | |
| en1 |
|
jqdai0815 | 2018-12-03 19:09:46 | 620 | Initial revision (saved to drafts) |
