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?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ 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: Nov/05/2026 20:46:45 (g2).
Desktop version, switch to mobile version.
Supported by
