Super Jumping! Jumping! Jumping!---hdu1087（动态规划）

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 1100
#define INF 0xfffffff
int main()
{
    int n, a[N], dp[N], Max;
    while(scanf("%d", &n), n)
    {
        memset(a, 0, sizeof(a));
        memset(dp, 0, sizeof(dp));
        for(int i=1; i<=n; i++)
        {
            scanf("%d", &a[i]);
        }
        Max = 0;
        for(int i=1; i<=n; i++)
        {
            dp[i] = a[i];
            for(int j=1; j<=i; j++)
            {
                if(a[i]>a[j])
                    dp[i] = max(dp[i], dp[j]+a[i]);
            }
            Max = max(Max, dp[i]);
        }
        printf("%d\n", Max);
    }
    return 0;
}