HDU 1087 Super Jumping! Jumping! Jumping!

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int MAXN=2005;
const int INF=1<<20;
int End,n;
int a[MAXN];
int dp[MAXN];

/******************************************
dp[i]：表示以a【i】结尾，单调递增序列和的最大值
******************************************/
void solve(){

int res=-INF;
for(int i=0;i<n;i++){
dp[i]=a[i];
for(int j=0;j<i;j++){
if(a[j]<a[i])
dp[i]=max(dp[i],dp[j]+a[i]);
}
res=max(dp[i],res);
}
cout<<res<<endl;
}

int main(){
while(scanf("%d",&n)!=EOF&&n){
for(int i=0;i<n;i++)
scanf("%lld",&a[i]);
solve();
}
return 0;
}