hdu 1087 Super Jumping! Jumping! Jumping!-dp 最长上升子序列和

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

 

水水DP!

 

#include <stdio.h>#include <string.h>#include <math.h>#include <stdlib.h>#include <iostream>#include <algorithm>using namespace std;int a[1010],dp[1010];int main(){    int n;    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]);    }     for(int i=1;i<=n;i++)    {        for(int j=i-1;j>=0;j--)        {            if(a[i]>a[j])            dp[i]=max(dp[i],a[i]+dp[j]);        }    }      sort(dp+1,dp+1+n);      printf("%d\n",dp[n]);    }    return 0;}