given an undirected graph, you have to remove some nodes to maximize the number of connected components. ↵
↵
when roemoving a node, you have to remove all its edges.
↵
when r
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 | TuHoangAnh | 2022-02-11 12:37:34 | 2 | Tiny change: '\n\nwhen romoving a n' -> '\n\nwhen removing a n' | ||
en1 | TuHoangAnh | 2022-02-11 12:33:22 | 220 | Initial revision (published) |
Название |
---|