Wonderful DP problem
Difference between en2 and en3, changed 13 character(s)
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 ?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en7 English 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 English FO7 2023-08-12 14:18:00 94
en5 English FO7 2023-08-12 14:14:12 10
en4 English FO7 2023-08-12 14:13:16 708
en3 English FO7 2023-08-11 09:16:21 13 Tiny change: 's or ideas to optimise ?' -> 's or ideas?'
en2 English FO7 2023-08-11 09:09:12 32 Tiny change: 'n<=1e3 .. ' -> 'n<=1e3 .. Any Hints or ideas to optimise ?'
en1 English FO7 2023-08-10 23:05:45 185 Initial revision (published)