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 ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Wonderful DP problem
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 ?
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) |
Name |
---|