i was trying to solve this DP problem … i guessed the state … dp[i][j]-> minimum cost when our first finger is at index I and second finger is at index j… i am not getting how to write the relation with previous state?? can anyone help plzzzzzz???

problem link —

can anyone help me to solve this problem https://onlinejudge.org/index.php?option=onlinejudge&Itemid=8&page=show_problem&problem=4628