hdu 1087 Super Jumping! Jumping! Jumping!

Roly_Yu

于 2014-03-13 14:13:10 发布

阅读量358

点赞数

分类专栏：动态规划

本文链接：https://blog.youkuaiyun.com/roly_yu/article/details/21169133

版权

动态规划专栏收录该内容

25 篇文章

订阅专栏

#include<iostream>
#include <stdio.h>
#define MAXN 1000
using namespace std;
int a[MAXN+10];
int dp[MAXN+10];
int main()
{
    intn,i,j,maxsum;
   while(scanf("%d",&n),n){
        for(i=1;i<=n;i++){
            scanf("%d",&a[i]);
            dp[i]=a[i];
        }
        maxsum=0;
        for(i=1;i<=n;i++){
           for(j=1;j<i;j++){
              if(a[j]<a[i]&&dp[j]+a[i]>dp[i])
                   dp[i]=dp[j]+a[i];
               if(dp[i]>maxsum)
                   maxsum=dp[i];
           }
        }
        printf("%d\n",maxsum);
    }
    return0;
}