hdu1087 super jumping

注意:这道题不是让求最长不降子序列，这是求出在不降序列中 序列和的最大值

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

using namespace std;

const int maxn = 1000 + 10;

int num[maxn];
int dp[maxn];	//dp[i] 到达结点序号为 i 时的最大值,序号从1开始
int N;

void work()
{
	for (int i = 2; i <= N; i++)
	{
		for (int j = 0; j < i; j++)				//这个地方 j从0开始，使得到达j最小也是num[i]，在这WA了一次
		{
			if (num[j] < num[i])
				dp[i] = max(dp[i], dp[j] + num[i]);
		}
	}
}


int main()
{
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	while (1 == scanf("%d", &N) && N > 0)
	{
		memset(dp, 0, sizeof(dp));
		memset(num, 0, sizeof(num));

		for (int i = 1; i <= N; i++)
			scanf("%d", &num[i]);
		dp[1] = num[1];
		int ans = -1;
		work();

		for (int i = 1; i <= N; i++)
		{
			if (ans < dp[i])
				ans = dp[i];
		}

		printf("%d\n", ans);
	}
	return 0;
}