Super Jumping! Jumping! Jumping!

最新推荐文章于 2023-04-06 21:03:43 发布

原创最新推荐文章于 2023-04-06 21:03:43 发布 · 351 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一款名为“SuperJumping!Jumping!Jumping!”的游戏，并详细解析了如何通过动态规划算法来计算玩家在游戏过程中能够获得的最大得分。文章提供了完整的代码实现，并附带输入输出样例。

点击打开链接

Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.

The game can be played by two or more than two players. It consists of a chessboard（棋盘）and some chessmen（棋子）, and all chessmen are marked by a positive integer or “start” or “end”. The player starts from start-point and must jumps into end-point finally. In the course of jumping, the player will visit the chessmen in the path, but everyone must jumps from one chessman to another absolutely bigger (you can assume start-point is a minimum and end-point is a maximum.). And all players cannot go backwards. One jumping can go from a chessman to next, also can go across many chessmen, and even you can straightly get to end-point from start-point. Of course you get zero point in this situation. A player is a winner if and only if he can get a bigger score according to his jumping solution. Note that your score comes from the sum of value on the chessmen in you jumping path.
Your task is to output the maximum value according to the given chessmen list.

Input

Input contains multiple test cases. Each test case is described in a line as follow:
N value_1 value_2 …value_N
It is guarantied that N is not more than 1000 and all value_i are in the range of 32-int.
A test case starting with 0 terminates the input and this test case is not to be processed.

Output

For each case, print the maximum according to rules, and one line one case.

Sample Input

Sample Output

4
10
3

  解析： dp[i] = max(num[i] , dp[j:(1~i-1)] + num[i])   	num[i] > num[j]

         dp[i]:以i结尾的数字可构成的最大和

#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
//max,min,swap,unique
//dp[i]:以i结尾的数字可构成的最大和 

//   dp[i] = max(num[i] , dp[j:(1~i-1)] + num[i])   	num[i] > num[j]

int num[1000+5];
int dp[1005];		//表示以i结尾的子串的最大和 

int main()
{
	int n;
	while (~scanf ("%d",&n) && n)
	{
		for (int i = 1 ; i <= n ; i++)
			scanf ("%d",&num[i]);
		
		int ans = -INF;
		for (int i = 1 ; i <= n ; i++)
		{
			dp[i] = num[i];
			for (int j = 1 ; j < i ; j++)
			{
				if (num[i] > num[j])
					dp[i] = max(dp[i] , dp[j] + num[i]);
				ans = max(ans , dp[i]);
			}
		}
		printf ("%d\n",ans);
	}
	return 0;
}