1999A — A+B Again?
Video
1999B — Card Game
Video
1999C — Showering
Video
1999D — Slavic's Exam
Video
1999E — Triple Operation
Video
1999F — Expected Median
Video
1999G1 — Ruler (easy version)
Video
1999G2 — Ruler (hard version)
Video
Tutorial of Codeforces Round 964 (Div. 4)
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
why E gives tle for O(N) solution?
Java 275163443 C++ 275165193
Shayan
It is not mentioned in the problem statement that sum of (r-l) <= 2e5 or something like that , So you need to precompute and solve
got your point! thanks :)