Hdu 1087 Super Jumping! Jumping! Jumping!(dp)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087
解题思路:用dp数组记录到i位的最长上升序列的和,每一步往前找前置最大的符合题意的结果,转移方程dp[i]=max(dp[i],dp[j]+num[i]);
代码如下:
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1005
int dp[MAXN], num[MAXN];
int main() {
int n;
while (scanf("%d", &n) != EOF) {
if (n == 0)break;
memset(dp, 0, sizeof(dp));
int res = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
dp[i] = num[i];
for (int j = 1; j < i; j++) {
if (num[j] < num[i])//要满足题意
dp[i] = dp[j] + num[i] < dp[i] ? dp[i] : dp[j] + num[i];//找尽可能大的前驱,因为越大的值往前延申会更容易
}
res = res > dp[i] ? res : dp[i];
}
printf("%d\n", res);
}
return 0;
}