1087 Super Jumping! Jumping Jumping!

//动态规划#include<iostream>#include<algorithm>#include<cstring>using namespace std;int n;int a[1001];int sum[1001];int Max;void dp(){    Max=sum[1];    for(int i=1;i<=n;i++)    {        for(int j=1;j<i;j++)        {            //sum[i]=max(sum[j])+a[i];            if((a[j]<a[i])&&(sum[i]<sum[j]+a[i]))            {                sum[i]=sum[j]+a[i];            }            if(Max<sum[i])            {                Max=sum[i];            }        }    }    cout<<Max<<endl;}int main(void){    while(cin>>n&&n)    {        memset(a,0,sizeof(a));        memset(sum,0,sizeof(sum));        for(int i=1; i<=n; i++)        {            cin>>a[i];            sum[i]=a[i];//先每一个sum数组的初始化        }        dp();    }    return 0;}