hdu 1087 Super Jumping! Jumping! Jumping!(最大上升子序列之和)
来源:互联网 发布:淘宝图片包是什么 编辑:程序博客网 时间:2024/05/01 15:06
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
题意:求最大上升子序列的和
dp[i]代表最后元素是a[j]时的最大上升子序列之和
#include <iostream>#include <memory.h>#define NUM 1010#define INF 0x3f3f3f3fusing namespace std;int dp[NUM];int a[NUM];int main(){ int n; int ans; while(cin>>n&&n) { memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) { cin>>a[i]; } for(int i=1;i<=n;i++) { ans=-1; for(int j=0;j<=i-1;j++) { if(a[j]<a[i]) { ans=max(ans,dp[j]); } } dp[i]=ans+a[i]; } int Max=dp[1]; for(int i=2;i<=n;i++) { if(Max<dp[i]) Max=dp[i]; } cout<<Max<<endl; } return 0;}
0 0
- 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!(LIS变形题,求上升子序列的最大和)
- 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! (线性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 上升子序列最大和)
- hdu1087 Super Jumping! Jumping! Jumping!【最大上升子序列】
- hduoj Super Jumping! Jumping! Jumping!【最大上升子序列和】
- 浅谈hashCode 和 equals 的关系
- wordpress jquery插件分页
- java中的强,软,弱,虚引用(及利用软引用实现高速缓存)
- String 字符串常量,StringBuffer 字符串变量(线程安全),StringBuilder (非线程安全)
- 前端模块化
- hdu 1087 Super Jumping! Jumping! Jumping!(最大上升子序列之和)
- quartus ii 使用ModelSim
- HTTP状态码
- Linux下" >/dev/null 2>&1 "相关知识说明
- STM32 寄存器地址名称映射
- jsp处理中文乱码
- Python输出字符奇数位置
- Hadoop伪分布式搭建-(3)
- CSS3 RGBA