hdu1087 简单dp

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <string>
#define INF 0x3f3f3f3
using namespace std;
typedef long long int LL;
const int maxn=1000+5;
int a[maxn],dp[maxn];
int N;
int main()
{
    while(~scanf("%d",&N)&&N)
    {
        memset(dp,0,sizeof(dp));
        int ans=-INF;
        for(int i=1;i<=N;i++)
        {
            scanf("%d",&a[i]);
            dp[i]=a[i];
            for(int j=1;j<=i-1;j++)
                if(a[i]>a[j])
                     dp[i]=max(dp[i],dp[j]+a[i]);
            ans=max(ans,dp[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}