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 ..
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 162 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
8 | SecondThread | 146 |
8 | TheScrasse | 146 |
10 | Petr | 145 |
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 ..
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 |
---|