hdu 1087 Super Jumping! Jumping! Jumping!

#include<bits/stdc++.h>
using namespace std;
int num[1010],dp[1010];
int main ()
{
    int n,ans;
    while (scanf("%d",&n),n)
    {
        ans=0;
        memset(dp,0,sizeof(dp));
        for (int i=0;i<n;i++)
        {
            scanf("%d",&num[i]);
        }
        dp[0]=num[0];
        for (int i=1;i<n;i++)
        {
            for (int j=0;j<i;j++)
            {
                if (num[i]>num[j])
                dp[i]=max(dp[i],dp[j]+num[i]);
            }
            dp[i]=max(dp[i],num[i]);
        }
        for (int i=0;i<n;i++)
        {
            ans=max(Max,dp[i]);
        }
        printf ("%d\n",ans);
    }
    return 0;
}

添加链接描述