hdu 1087 Super Jumping! Jumping! Jumping! (动态规划,求最长子序列之和)
来源:互联网 发布:虚拟机ubuntu怎样重置 编辑:程序博客网 时间:2024/04/30 08:23
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33587 Accepted Submission(s): 15200
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.
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.
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 24 1 2 3 44 3 3 2 10
Sample Output
4103#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>using namespace std;int a[1001],b[1001];int main(){ int n,i,j; while(scanf("%d",&n)&&n) { memset(b,0,sizeof(b)); for(i=1;i<=n;i++) scanf("%d",&a[i]); for(i=1;i<=n;i++) { int maxb=0; b[i]=a[i]; for(j=1;j<=n;j++) { if(a[j]<a[i]) { maxb=max(maxb,b[j]); } } b[i]+=maxb; } int sum=0; for(i=1;i<=n;i++) sum=max(sum,b[i]); printf("%d\n",sum); } return 0;}
0 0
- hdu 1087 Super Jumping! Jumping! Jumping! (动态规划,求最长子序列之和)
- Super Jumping! Jumping! Jumping! 【hdu-1087】【动态规划-最长上升子序列】
- 【HDU 1087】Super Jumping! Jumping! Jumping!(最大上升子序列和,动态规划)
- HDU 1087 Super Jumping! Jumping! Jumping!最长上升子序列
- Super Jumping! Jumping! Jumping!(求最长递增子序列之和)
- [ACM] hdu 1087 Super Jumping! Jumping! Jumping! (动态规划)
- HDU 1087 Super Jumping! Jumping! Jumping!(动态规划)
- hdu 1087 Super Jumping! Jumping! Jumping!(动态规划DP)
- HDU 1087 Super Jumping! Jumping! Jumping! (动态规划)
- HDU 1087 Super Jumping! Jumping! Jumping![动态规划——最大递增子序列]
- hdu 1087 Super Jumping! Jumping! Jumping!(最大上升子序列之和)
- hdu 1087 Super Jumping! Jumping! Jumping!(最长上升子序列变形)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp 最长上升子序列和)
- HDU 1087 Super Jumping! Jumping! Jumping! (最长上升子序列和)
- HDU 1087 Super Jumping! Jumping! Jumping!(dp最长上升子序列的和)
- HDU 1087 Super Jumping! Jumping! Jumping!(求绝对递增子序列的最大和)
- Super Jumping! Jumping! Jumping! (最长子序列)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp+最长递增序列)
- 一个人的旅行
- mysql数据库中文乱码问题,修改mysql字符集(Linux Windows)
- 如何从手机音频口获得电能
- IDEA 常用快捷键
- java库Html2Image:实现html转图片功能
- hdu 1087 Super Jumping! Jumping! Jumping! (动态规划,求最长子序列之和)
- Android apk瘦身之使用TinyPng压缩图
- HD--1874畅通工程续 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) To
- Excel导入(.net Excel导入操作)
- Lucene教程(三) 索引域选项
- jmeter+ant+jenkins进行持续化集成
- PDO错误处理
- 让Qt自定义窗口边界可以拉伸
- bootStrap学习心得