given an undirected graph, you have to remove some nodes to maximize the number of connected components.
when removing a node, you have to remove all its edges.
№ | Пользователь | Рейтинг |
---|---|---|
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 | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
maximize the number of connected components in a graph.
given an undirected graph, you have to remove some nodes to maximize the number of connected components.
when removing a node, you have to remove all its edges.
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) |
Название |
---|