Super Jumping! Jumping! Jumping! HDU - 1087

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/fuyuyarei/article/details/79186105

最长上升子序列和QAQ
有nlogn的算法一会再看
http://blog.csdn.net/yopilipala/article/details/60468359

#include<stdio.h>
#include<string.h>
using namespace std;
long long dp[1005];
int p[1005];
int ans;
int max(int a,int b)
{
    if(a>b) return a;
    return b;
}
int main()
{
    int n;
    while(scanf("%d",&n) && n!=0)
    {
        memset(p,0,sizeof(p));
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
            scanf("%d",&p[i]);
            dp[1]=p[1];
        ans=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=0;j<=i;j++)
            {
            if(p[i]>p[j])
            dp[i]=max(dp[i],dp[j]+p[i]);
            else dp[i]=max(p[i],dp[i]);
            }
            ans=max(dp[i],ans);
        }
        printf("%d\n",ans);
    }
    return 0;
}