1335E2 - Three Blocks Palindrome (hard version)
In this problem, the solution outlined by the editorial is $$$O(n*200*200)$$$, here $$$N$$$ <= $$$200000$$$.
How is the solution able to pass with that time complexity on a constraint like this?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | Dominater069 | 161 |
| 4 | Um_nik | 160 |
| 5 | atcoder_official | 159 |
| 6 | djm03178 | 157 |
| 7 | adamant | 153 |
| 8 | luogu_official | 151 |
| 9 | awoo | 149 |
| 10 | TheScrasse | 146 |
→ Find user
→ Recent actions
Need help with Time Complexity of this problem
Revision en1, by --oOoOoOoOoOoOo--, 2020-09-18 13:01:16
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
--oOoOoOoOoOoOo-- | 2020-09-18 13:01:16 | 257 | Initial revision (published) |
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/31/2025 13:43:19 (k2).
Desktop version, switch to mobile version.
Supported by
