Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link ×

wish_me's blog

By wish_me, history, 2 years ago, In English,

While I was solving this DP ,

I think we can do it by 3d-DP.But I am able to make only two states dp[i][j][?] where i is currently index and j is how many letters we can change.Can any one suggest me the third state or the approach??

  • Vote: I like it
  • -4
  • Vote: I do not like it