hdu1087

原创 2016年06月02日 01:06:42

Super Jumping! Jumping! Jumping!

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

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

Author
lcy
经典dp

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int dp[1005],num[1005];
int main(){
    int n,i,j,max;
    while(scanf("%d",&n)!=EOF&&n){
        memset(dp,0,sizeof(dp));

        for ( i = 0; i < n; ++i)
        {
            scanf("%d",&num[i]);
        }
        max=dp[0]=num[0];
        for ( i = 1; i < n; ++i)
        {
            dp[i]=num[i];
            for ( j = 0; j < i; ++j)
            {
                if(num[j]<num[i]){
                    if(dp[i]<dp[j]+num[i])
                    dp[i]=dp[j]+num[i];
                }

            }
            if(max<dp[i])max=dp[i];
        }

        printf("%d\n",max );
    }
    return 0;
}
版权声明:本文为博主原创文章,转载请注明出处。

动态规划 HDU 1087

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3276...
  • lxx_nico
  • lxx_nico
  • 2014年10月17日 21:03
  • 319

HDU 1087 Super Jumping! Jumping! Jumping!(DP,上升子序列)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087 Super Jumping! Jumping! Jumping! Time Limit: 2...
  • zero_witty
  • zero_witty
  • 2016年05月26日 21:39
  • 213

hdu1087 最大增序之和

Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. May...
  • nucshiyilang
  • nucshiyilang
  • 2016年05月18日 00:24
  • 272

neu dp b题 hdu1087

第一次写题解,希望能从中学习 题意: 给一列数,求其上升子序列中,所有数之和最大的; 答案只要这个和就可以了;思考轨迹, 拿到这个题首先想到以前做过的最长上升子序列和最...
  • sinat_35995826
  • sinat_35995826
  • 2016年08月29日 17:37
  • 56

HDU 1087 Super Jumping! Jumping! Jumping! (线性dp 最大上升子序列)

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3276...
  • Tc_To_Top
  • Tc_To_Top
  • 2015年02月12日 01:15
  • 533

POJ 1087&&HDU 1526 A Plug for UNIX (二分图+Floyd传递闭包 )

题目大意: 有n个插座,下边n行分为为插座的类型,m个电器,m行分别代表电器的名称和插头的类型. 最后,有k行数据每组,对应适配器的插座和插头的类型.    思路:将所有的插座,插头编上序...
  • Grit_ICPC
  • Grit_ICPC
  • 2015年10月14日 21:49
  • 304

HDU:1087 Super Jumping! Jumping! Jumping!(DP,LIS问题)

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768...
  • zugofn
  • zugofn
  • 2016年04月12日 23:28
  • 161

hdu 1087 Super Jumping! Jumping! Jumping!(dp:上升子序列最大和)

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3276...
  • acm_BaiHuzi
  • acm_BaiHuzi
  • 2015年03月21日 00:40
  • 651

HDU---1087-Super Jumping! Jumping! Jumping!(DP)

Super Jumping! Jumping! Jumping! Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/3276...
  • qq978874169
  • qq978874169
  • 2015年06月22日 14:47
  • 241

hdu 1421 1159 1087 1160 5366 1257 light OJ 1110 uva 562 简单dp

#include #include #include #include #include #include #include #include #include #include u...
  • qq_24667639
  • qq_24667639
  • 2015年08月05日 10:18
  • 429
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdu1087
举报原因:
原因补充:

(最多只允许输入30个字)