HDU 1087 Super Jumping! Jumping! Jumping!(最大上升子序列和)
来源:互联网 发布:知乎日报 离线下载 编辑:程序博客网 时间:2024/05/22 00:50
传送门:点击打开链接
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40087 Accepted Submission(s): 18464
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<iostream>#include<algorithm>#include<cstring>#define ll long longusing namespace std;const int maxn=1005;int dp[maxn];//最长不降子序列的和,dp[i]代表前i项中最长不降子序列 int main(){int n,i,j,a[maxn],ans;while(cin>>n&&n){for(i=1;i<=n;i++)cin>>a[i];memset(dp,0,sizeof(dp));//dp[1]=a[1];for(i=1;i<=n;i++){ans=0;for(j=0;j<i;j++){if(a[j]<a[i])ans=max(ans,dp[j]);}dp[i]=ans+a[i];}int maxi=0;for(i=0;i<=n;i++)maxi=max(maxi,dp[i]);cout<<maxi<<endl;}return 0;}
阅读全文
0 0
- hdu 1087 Super Jumping! Jumping! Jumping!(LIS变形题,求上升子序列的最大和)
- 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!(最大上升子序列和)
- 【HDU 1087】Super Jumping! Jumping! Jumping!(最大上升子序列和,动态规划)
- HDU-1087 Super Jumping! Jumping! Jumping! (线性dp 上升子序列最大和)
- hduoj Super Jumping! Jumping! Jumping!【最大上升子序列和】
- HDU 1087 Super Jumping! Jumping! Jumping!最长上升子序列
- HDU 1087.Super Jumping! Jumping! Jumping!【最大上升子序列和】【1月2】
- 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!(最大上升子序列)
- selinux基础
- 并发服务器实现原理
- ACM训练日记—8月7日
- Mark-20170807-k8s-假装终于成功安装 dashboard
- Apache Spark 2.2.0 官方文档中文版(翻译完成 98%. 除 MLib 外) | ApacheCN
- HDU 1087 Super Jumping! Jumping! Jumping!(最大上升子序列和)
- 包装对象和内置对象
- windows gdi+ 简单加载自定义字体 .tff库
- Summer Training day4 Code hdu5212 莫比乌斯反演
- 2017/8/7训练日记(Floyd算法求最短路径)
- 第一次尝试修改WIFI
- 双向队列
- static_cast
- 编写第一个 Shell 脚本