[HDU 1087]Super Jumping! Jumping! Jumping!(类LIS DP)

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>

#define MAXN 1010

using namespace std;

int s[MAXN]; //输入的序列
int f[MAXN];

int max(int a,int b)
{
if(a>b) return a;
return b;
}

int main()
{
int n;
while(scanf("%d",&n)!=EOF&&n)
{
memset(f,0,sizeof(f));
int ans=0;
for(int i=1;i<=n;i++)
scanf("%d",&s[i]);
for(int i=1;i<=n;i++)
for(int j=0;j<i;j++)
if(s[i]>s[j])
f[i]=max(f[i],f[j]+s[i]);
for(int i=1;i<=n;i++)
ans=max(ans,f[i]);
printf("%d\n",ans);
}
return 0;
}