I finish this code, but the judger says I am out of bounds, can anyone tell me why or is there anyting wrong on other places? Thanks very much.
Begged for help.
In the official tutorial, we defined a dp[i][j] array which means that we consider 1~i and has j elements that haven't been deleted, I just want to ask if it is possible to solve it by redefined the dp: consider 1~i and has already use j moves. Could anyone tell me if my idea is possible to solve problem?