计蒜客 跳跃游戏二 动态规划

            思路：只需要一直往右跳跃即可，没必要往左跳。dp(i)表示到达下标i的最小跳跃次数，递推其后的len[i]个点，dp(j) = min(dp(i)+1)

AC代码

#include <cstdio>
#include <cmath>
#include <cctype>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <utility>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000") 
#define eps 1e-10
#define inf 0x3f3f3f3f
#define PI pair<int, int> 
typedef long long LL;
const int maxn = 100 + 5;
int a[maxn], dp[maxn];
int main() {
	int n;
	while(scanf("%d", &n) == 1) {
		for(int i = 0; i < n; ++i) {
			dp[i] = inf;
			scanf("%d", &a[i]);
		}
		dp[0] = 0;
		for(int i = 0; i < n-1; ++i) {
			int jump = a[i];
			for(int j = i+1; j <= i+jump && j < n; ++j) {
				dp[j] = min(dp[i] + 1, dp[j]);
			}
		}
		printf("%d\n", dp[n-1]);
	}
	return 0;
}

如有不当之处欢迎指出！