I submitted this to 527C: h[submission:167938194]
I'm sure that it's O(nlogn) ($$$n \leq 2 \times 10^5$$$), and I TLEed on 7.
Please help me!
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | Benq | 3783 |
| 3 | Radewoosh | 3602 |
| 4 | Um_nik | 3541 |
| 5 | fantasy | 3526 |
| 6 | maroonrk | 3504 |
| 7 | ko_osaga | 3500 |
| 8 | jiangly | 3465 |
| 9 | orzdevinwang | 3460 |
| 10 | cnnfls_csy | 3427 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 180 |
| 2 | -is-this-fft- | 177 |
| 3 | nor | 169 |
| 4 | Um_nik | 168 |
| 5 | SecondThread | 164 |
| 6 | maroonrk | 163 |
| 7 | adamant | 161 |
| 8 | kostka | 160 |
| 9 | YouKn0wWho | 158 |
| 10 | errorgorn | 153 |
→ Find user
→ Recent actions
Hello,I'm a 10-years-old student from China.I like CodeForces! I like to write code with C++ and Java. Eric
Codeforces (c) Copyright 2010-2023 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/05/2023 21:03:47 (j3).
Desktop version, switch to mobile version.
Supported by
