| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
A difficult interval problem
I saw this on AIO 2020 and have no idea.
On an interval ranged 1 ~ L there are N segments (Ai, Bi)
You can add at most k extra segments with length X.
What is the longest continuous interval you can get that is covered by segments?
2 <= L <= 10^9
0 <= k <= 10^9
N <= 10^5
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
Mopriestt | 2022-07-29 16:08:37 | 27 | Tiny change: ' 10^5\n\n[Your text to link here...](/predown' -> ' 10^5\n\n[sample](/predown' | |
| en4 |
|
Mopriestt | 2022-07-29 16:08:17 | 94 | (published) | |
| en3 |
|
Mopriestt | 2022-07-29 16:05:46 | 4 | ||
| en2 |
|
Mopriestt | 2022-07-29 16:05:33 | 4 | Tiny change: ' <= 10^9\n0 <= k <= 10^9\nN <= 10^' -> ' <= 10^9\n\n0 <= k <= 10^9\n\nN <= 10^' | |
| en1 |
|
Mopriestt | 2022-07-29 16:04:42 | 325 | Initial revision (saved to drafts) |
