Hdu 1087 Super Jumping! Jumping! Jumping! （DP）


题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=1087
思路：dp[i] 表示 在第i位置能够得到的最大分数，dp[i] = max(dp[j] if a[j]<a[i]) + a[i];

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 1000+5
#define LL __int64
int a[maxn];
LL dp[maxn];
int main(){
int n;
while(~scanf("%d",&n) , n){
for (int i = 1; i <= n; i++)
{
scanf("%d",&a[i]);
dp[i] = a[i];
}
LL ans = dp[1];
for (int i = 2; i <= n; i++)
{
for (int j = i; j >= 1; j--)
{
if(a[j] < a[i] && dp[i] < dp[j]+a[i])
dp[i] = dp[j]+a[i];
}
ans = max(ans,dp[i]);
}
printf("%I64d\n",ans);
}
return 0;
}