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
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Wonderful DP problem
Difference between en1 and en2,
changed 32 character(s)
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-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 19:43:22 (i1).
Desktop version, switch to mobile version.
Supported by
