HDU 1087 Super Jumping! Jumping! Jumping!【最大递增子段和】

Problem Description
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.

View Code

#include<stdio.h>
int main()
{
int i,j,n,max,tot;
int a[1001];
int sum[1001];
while(scanf("%d",&n),n)
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=tot=0;j<n;j++)
{
for(i=max=0;i<=j;i++)
if(a[i]<a[j])
{
if(sum[i]>max)
max=sum[i];
}
sum[j]=max+a[j];
if(sum[j]>tot)
tot=sum[j];
}
printf("%d\n",tot);
}
return 0;
}