【HDU 1087】Super Jumping! Jumping! Jumping!（最大上升子序列和，动态规划）

最新推荐文章于 2024-10-01 18:52:56 发布

原创最新推荐文章于 2024-10-01 18:52:56 发布 · 491 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#动态规划

动态规划专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一款名为SuperJumping的游戏，并提供了一个算法解决方案来计算玩家在游戏中所能获得的最大得分。该算法采用动态规划的方法，确保从起点到终点的路径上所经过的所有棋子数值之和最大。

这里是题目

Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 40411 Accepted Submission(s): 18655

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
0

Sample Output
4
10
3

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
//dp[i]:以i结尾的数字可构成的最大和 
//   dp[i] = max(num[i] , dp[j:(1~i-1)] + num[i])      
int main()
{
    int n,a[1111];
    while(~scanf("%d",&n),n)
    {
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        int dp[1010];       //表示以i结尾的子串的最大和 
         int ans=0;
        for(int i=0;i<n;i++)
        {
            dp[i]=a[i];
            for(int j=0;j<i;j++)
            {
                if(a[i]>a[j])
                {
                    dp[i]=max(dp[i],dp[j]+a[i]);
                }
                ans=max(ans,dp[i]);
            }
        }
        printf("%d\n",ans);
    }
return 0;
}