HDU-1087-Super Jumping! Jumping! Jumping!

最新推荐文章于 2024-08-02 10:00:00 发布

pomake

最新推荐文章于 2024-08-02 10:00:00 发布

阅读量272

点赞数

CC 4.0 BY-SA版权

分类专栏：动态规划

本文链接：https://blog.youkuaiyun.com/pomake/article/details/76937489

动态规划专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一款名为“SuperJumping!Jumping!Jumping!”的游戏，玩家需从起点跳跃到终点，途中经过的棋子数值总和即为得分。文章提供了实现这一游戏逻辑的C++代码示例，通过动态规划算法寻找最大得分路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Super Jumping! Jumping! Jumping!

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 40385 Accepted Submission(s): 18636

Problem Description

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

3 1 3 2

4 1 2 3 4

4 3 3 2 1

Sample Output

Author

lcy

转移状态方程式 :dp[i]=max(dp[i],dp[j]+a[i])

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
	int n,a[1001],dp[1001],sum;
	while(scanf("%d",&n)&&n){
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
		}
		sum=0;
		for(int i=1;i<=n;i++){
			dp[i]=a[i]; 
			for(int j=1;j<i;j++){
				if(a[i]>a[j]){
					dp[i]=max(dp[i],dp[j]+a[i]);//比较其大小； 
				}
				sum=max(sum,dp[i]);
			}
		}
		printf("%d\n",sum);
	}
return 0;
}