hdu 1087 简单dp

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#define MAX 1007

using namespace std;

int dp[MAX];
int a[MAX];

int main  ( )
{
    int n;
    while ( ~scanf ( "%d" , &n ),n )
    {
        for ( int i = 1 ; i <= n ; i++ ) scanf ( "%d" , &a[i] );
        memset ( dp , 0 , sizeof ( dp ) );
        int ans = 0;
        a[0] = 0;
        for ( int i = 1 ; i <= n ; i++ )
            for ( int j = 0 ; j < i ; j++ )
                if ( a[i] > a[j] )
                {
                    dp[i] = max ( dp[j]+a[i] , dp[i] );
                    ans = max ( ans , dp[i] );   
                }
        printf ( "%d\n" , ans );
    }
}