ZOJ 1087 Super Jumping! Jumping! Jumping!(简单DP)

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=1010;

int dp[maxn],a[maxn],n;
int main(){
while (scanf("%d",&n)&&n){
for (int i=0;i<n;++i){
scanf("%d",&a[i]);
dp[i]=a[i];
}
int ans=a[0];
for (int i=1;i<n;++i){
for (int j=0;j<i;++j){
if(a[i]>a[j]&&a[i]+dp[j]>dp[i]){
dp[i]=dp[j]+a[i];
}
}
ans=max(ans,dp[i]);
}
printf("%d\n",ans);
}
return 0;
}