I_m_sfg's blog

help me please
By I_m_sfg, history, 7 hours ago, In English

You have an array of length n and can start at any index. In one operation, you can move either left, right, or stay at your position to pick the value arr[i].After picking the value, increase all the elements in the array by 1. Find the maximum sum you can get after performing k operations.

Tags c++, dp
  • Vote: I like it
  • 0
  • Vote: I do not like it

»
7 hours ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

I guess its dp[K+1][N]. With transition as dp[i+1][j-1]+=arr[j]+k;dp[i+1][j+1]+=arr[j]+k; But you ofc need to check boundaries.

→ Reply