Given an interval [L, R]. Given an array of intervals in the form of Li and Ri. How many minimum intervals required to cover the range [L, R]? Intervals can overlap with each other. L>=1 && R<=1e5 Li>=1 && Ri<=1e5 The size of the array <= 1e5
→ Pay attention
→ Top rated
| # | 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 |
→ Top contributors
| # | 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 |
→ Find user
→ Recent actions
Need Help in This Standard Problem of Interval Covering
Revision en2, by Finding_Infinity, 2020-03-06 18:00:47
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Finding_Infinity | 2020-03-06 18:00:47 | 30 | Tiny change: ' Ri<=1e5\n\n' -> ' Ri<=1e5\nThe size of the array <= 1e5\n\n' | |
| en1 |
|
Finding_Infinity | 2020-03-06 17:56:28 | 277 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/05/2024 12:22:03 (h1).
Desktop version, switch to mobile version.
Supported by
