hdu 1087 DP简单题

//2562511 2010-06-29 17:53:55 Accepted 1087 31MS 236K 517 B C++
//DP简单题
#include <iostream>
#include<string.h>
#include<cstdio>
#define max_size 1002
using namespace std;
int main()
{
int dp[max_size];
int a[max_size];
int n,i,j,sum;
while(scanf("%d",&n) != EOF && n)
{
sum = 0;
for(i = 0; i < n; i++)
{

scanf("%d",&a[i]);
dp[i] = a[i];
for(j = 0; j < i; j++)
{
if(a[i] > a[j] && dp[i] < dp[j] + a[i])
{
dp[i] = dp[j] + a[i];
}
if(dp[i] > sum)
{
sum = dp[i];
}
}
}
printf("%d/n",sum);
}
}