How i can solve it if n = 5000 in the following problem ? http://postimg.org/image/4cfbw9vc5/ thanks in advance :)
Rating changes for last rounds are temporarily rolled back. They will be returned soon.
→ Pay attention
Before contest
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2)
15:27:16
Register now »
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2)
15:27:16
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3582 |
| 5 | strapple | 3515 |
| 6 | tourist | 3473 |
| 7 | Radewoosh | 3418 |
| 8 | Um_nik | 3376 |
| 9 | potato167 | 3368 |
| 10 | maroonrk | 3361 |
→ Top contributors
| # | 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 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/23/2026 02:07:45 (g1).
Desktop version, switch to mobile version.
Supported by
The naive O(N3) approach can be optimized to O(N2).
Read about palindrome partitioning