Given a sequence of integers ,find a subsequence of largest length such that in the subsequence adjacent elements are not equal at most k times. n<=1e3,k<=n<=1e3 .. Any Hints or ideas to optimise ?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
FO7 | 2023-08-12 14:21:46 | 20 | Tiny change: ' i-1][j-1].I have t' -> ' i-1][j-1] using map[value][j].I have t' | |
| en6 |
|
FO7 | 2023-08-12 14:18:00 | 94 | ||
| en5 |
|
FO7 | 2023-08-12 14:14:12 | 10 | ||
| en4 |
|
FO7 | 2023-08-12 14:13:16 | 708 | ||
| en3 |
|
FO7 | 2023-08-11 09:16:21 | 13 | Tiny change: 's or ideas to optimise ?' -> 's or ideas?' | |
| en2 |
|
FO7 | 2023-08-11 09:09:12 | 32 | Tiny change: 'n<=1e3 .. ' -> 'n<=1e3 .. Any Hints or ideas to optimise ?' | |
| en1 |
|
FO7 | 2023-08-10 23:05:45 | 185 | Initial revision (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/17/2026 07:38:18 (f1).
Desktop version, switch to mobile version.
Supported by
