| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3757 |
| 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 | 171 |
| 2 | adamant | 164 |
| 3 | awoo | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 155 |
| 6 | maroonrk | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 145 |
| 9 | pajenegod | 145 |
How to solve this Graphical problem?
Give you an undirected graph with no guarantee of connectivity, Erase 2 edges to minimize the maximum connected block. You only need to output The size of the largest connected block。
How to solve it in less than O(N^2) Time Complexity ?
Sorry of my suck English :(
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en4 |
|
Inversentropir-36 | 2020-11-19 07:25:35 | 69 | ||
| en3 |
|
Inversentropir-36 | 2020-11-18 11:08:32 | 247 | UPdate for our new algorithm. | |
| en2 |
|
Inversentropir-36 | 2020-11-16 08:56:02 | 2 | Tiny change: 'cted block。\n\nHow to' -> 'cted block.\n\nHow to' | |
| en1 |
|
Inversentropir-36 | 2020-11-16 08:53:14 | 307 | Initial revision (published) |
