Help Needed in DP Problem !!

Revision en1, by anupamshah_, 2020-04-07 00:01:55

Here is the link to the problem . I have gone through the editorial but didn't got the approach ( Although I got that we don't need to take more than 2 occurences of a partical triplet [x1,x1+1.x2+2] ) ,I was thinking of DP with three states position i, frequency of i-1th character we took and frequency of i-2nd character we took.

But wasn't able to come up with a solution. Can anybody help me with the solution ?

Tags #dynamic programing, #3d-dp, #dp, #help, whocaresabouttags

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English anupamshah_ 2020-04-07 13:33:04 2 Tiny change: 't [x1,x1+1.x1+2]_ ) ,' -> 't [x1,x1+1,x1+2]_ ) ,'
en2 English anupamshah_ 2020-04-07 13:32:30 2 Tiny change: '[x1,x1+1.x2+2]_ ) ,I ' -> '[x1,x1+1.x1+2]_ ) ,I '
en1 English anupamshah_ 2020-04-07 00:01:55 522 Initial revision (published)