HDU 1087 —— Super Jumping! Jumping! Jumping!

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

题意：求最大递增子序列和；

LIS裸题，只要加一个求和数组即可；

#include<cstdio>
#include<algorithm>

using namespace std;
const int maxn = 1100;
int a[maxn];
int dp[maxn], val[maxn];
int n;
int main()
{
	while(~scanf("%d", &n))
	{
		if(n == 0)	break;
		for(int i = 1;i<=n;i++)
		{
			scanf("%d", &a[i]);
			dp[i] = 1;
			val[i] = a[i];
		}
		int ans = 0, sum = 0;
		for(int i = 2;i<=n;i++)
		{
			for(int j = 1;j<i;j++)
			{
				if(a[i] > a[j] && dp[i] < dp[j]+1)
				{
					dp[i] = dp[j]+1;
					val[i] = max(val[i], val[j]+a[i]);
				}
			}
			if(ans < dp[i])
			{
				ans = dp[i];
				sum = max(sum, val[i]);
			}
		}
		printf("%d\n", sum);
	}
	return 0;
}