hdu1087Super Jumping! Jumping! Jumping!(dp)

http://acm.hdu.edu.cn/showproblem.php?pid=1087

7A。。。。简单的递推 没考虑负数的情况 一直乱改。。

#include <iostream>
#include<cstdio>
#include<string.h>
#define INF 0xfffffff
using namespace std;
long long dp[1011],a[1011];
int main()
{
    int i,j,k,n,m;
    while(scanf("%d",&n)&&n)
    {
        memset(dp,0,sizeof(dp));
        for(i = 1; i <= n ; i++)
        scanf("%lld",&a[i]);
        dp[0] = 0;
        long long max = 0;
        for(i = 1; i <= n; i++)
        {
            long long tmax = 0;
            if(a[i]<=0)
            {
                dp[i] = 0;
                continue;
            }
            for(j = 0; j <i ; j++)
            {
                if(a[i]>a[j]&&a[j]>=0&&dp[j]+a[i]>tmax)
                    tmax = dp[j]+a[i];
            }
            dp[i] = tmax;
            if(tmax>max)
            max = tmax;
        }
        printf("%lld\n",max);
    }
    return 0;
}