hdu 1087 Super Jumping! Jumping! Jumping! 动态规划

#include <iostream>
#include<cstdio>
#include<cmath>
#define N 1100
using namespace std;

int d
,a
;

int main()
{
int n;
while(scanf("%d",&n)&&n)
{
for(int i=1;i<=n;i++)   scanf("%d",&a[i]),d[i]=a[i];
int ans=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<i;j++)
if(a[j]<a[i])   d[i]=max(d[i],d[j]+a[i]);
ans=max(d[i],ans);
}
cout<<ans<<endl;
}
}