$$ progress$[$i$]$ is the amount of progress would make by doing the ith experiment, and

$.$ skip$[$i$]$ is the number of consecutive experiments must skip if he does the ith experiment. That is$,$ if

Expert does the ith experiment, he cannot do experiments i $+1$ through i $+$ skip$($i$].$ For example, if skip$[1]=3,$ he cannot do the $2$nd$,3$rd and $4$th experiments in a scenario where he chooses to do the first experiment.

let's definc P$($i$)=$ the maximum total progress can make from experiments i $...$ n then implement dynamic programming in java

the answer to the original problem.$)$