Super Jumping! Jumping! Jumping! hdu

#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int n;
int dp[1005],val[1005];

int main()
{
    while( scanf("%d",&n) && n ){
        for( int i=1 ; i<=n ; i++ )
            scanf("%d",&val[i]);
        int Max;
        Max = dp[1] = val[1];
        for( int i=1 ; i<=n ; i++ ){
            dp[i] = val[i];
            for( int j=1 ; j<i ; j++ ){
                if( val[i] > val[j] && dp[i] < dp[j]+val[i] )
                    dp[i] = dp[j] + val[i];
            }
            if( dp[i] > Max )
                Max = dp[i];
        }
        printf("%d\n",Max);
    }
    return 0;
}