hdu 1087 Super Jumping! Jumping! Jumping!（水DP）

#include <queue>
#include <stack>
#include <math.h>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <limits.h>
#include <string.h>
#include <string>
#include <algorithm>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define BUG puts("here!!!")

using namespace std;

const int MAX = 1010;
int dp[MAX];
int a[MAX];
int main()
{
	int n;
	
	while( ~scanf("%d",&n) && n )
	{
		for(int i=0; i<n; i++)
		{
			scanf("%d",&a[i]);
			dp[i] = a[i];
		}
		
		for(int i=1; i<n; i++)
			for(int k=0; k<i; k++)
				if( a[i] > a[k] )
					dp[i] = max(dp[i],dp[k] + a[i]);
		
		int ans = dp[max_element(dp,dp+n) - dp];
		printf("%d\n",ans);
	}
	
return 0;
}