寒假训练01E:hdu1087
2018-01-18 18:25
281 查看
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
题目大意&解题思路
其实就是一个求最大上升子序列和的问题。。。
代码
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<iostream> #include<algorithm> using namespace std; int main() { int n; int a[1005],dp[1005]; while(cin>>n&&n!=0) { for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n;i++) { dp[i]=a[i]; for(int j=0;j<i;j++) { if(a[j]<a[i]) dp[i]=max(dp[i],dp[j]+a[i]); } } sort(dp,dp+n); cout<<dp[n-1]<<endl; } return 0; }
相关文章推荐
- 寒假训练--01背包完全背包--小P的故事——神奇的分组
- 寒假训练--01背包完全背包--小P的故事——神奇的换零钱
- 寒假训练01G:hdu1260
- HDU - 2685 寒假训练 gcd的性质 快速幂
- 寒假训练01C:hdu1069
- 寒假训练—— HDU - 2094 产生冠军 DFS or BFS
- 寒假训练——HDU - 2532 Engine 模拟
- 寒假训练--01背包完全背包--小P的故事——神奇的饭卡
- 寒假训练三A - EXCEL排序 HDU - 1862
- 动态规划训练17 [Super Jumping! Jumping! Jumping! HDU - 1087 ]
- hdu - 1087 - Super Jumping! Jumping! Jumping!
- hdu-6124-Euler theorem(多校训练)
- hdu 1203 I NEED A OFFER!--01背包
- hdu 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping! && 1114 Piggy-Bank 简单dp
- HDU--1087 Super Jumping! Jumping! Jumping!
- 2014多校训练九(HDU 4960 HDU 4961 HDU 4965 HDU 4968 HDU 4969 HDU 4970)
- (2017多校训练第七场)HDU - 6129 Just do it 找规律
- hdu1087 Super Jumping! Jumping! Jumping!