| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3443 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | djm03178 | 155 |
| 9 | TheScrasse | 154 |
| 10 | Dominater069 | 153 |
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. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| 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) |
