Simple DP, dp[i] - minimum number of steps to reach position i. Then apply simple transitions: dp[i + step] = min(dp[i + step], dp[i] + 1), step <= a[i]. Something in this way.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
