hdu 1087 (最大上升子序列和)动态规划

# include <stdio.h>
# include <algorithm>
using namespace std;
int main()
{
int i,n,j,max,maxsum,a[1010],b[1010];
while(~scanf("%d",&n),n)
{
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=a[i];
}
maxsum=0;
for(i=0;i<n;i++)
{
max=0;
for(j=0;j<i;j++)
{
if(a[i]>a[j])
{
if(b[j]>max)
max=b[j];
}
}
b[i]+=max;
if(b[i]>maxsum)
maxsum=b[i];
}
printf("%d\n",maxsum);
}
return 0;
}