HDU1087:Super Jumping! Jumping! Jumping!(普通上升子序列 + dp)
来源:互联网 发布:精品营销软件 编辑:程序博客网 时间:2024/06/03 22:42
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35724 Accepted Submission(s): 16264
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
Author
lcy
思路:类似LIS方程,简单改一下就行。
# include <stdio.h># include <algorithm># define INF 0x7fffffffusing namespace std;int main(){ int n; long long a[1000], sum[1000], imax; while(~scanf("%d",&n),n) { imax = -INF-1; for(int i=0; i<n; ++i) { scanf("%lld",&a[i]); sum[i] = a[i]; } for(int i=0; i<n; ++i) { for(int j=0; j<i; ++j) if(a[j]<a[i]) sum[i] = max(sum[i], sum[j]+a[i]); imax = max(imax, sum[i]); } printf("%lld\n",imax); } return 0;}
0 0
- HDU1087:Super Jumping! Jumping! Jumping!(普通上升子序列 + dp)
- HDU1087 Super Jumping! Jumping! Jumping!【最长上升子序列+DP】
- hdu1087 Super Jumping! Jumping! Jumping!【最大上升子序列】
- HDU1087--Super Jumping! Jumping! Jumping! (DP动态规划最大上升子序列的和)
- HDU1087-Super Jumping! Jumping! Jumping!(dp)
- hdu1087 Super Jumping! Jumping! Jumping!(最长上升子序列和)
- 动态规划:HDU1087-Super Jumping! Jumping! Jumping!(最大上升子序列和)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp 最长上升子序列和)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp:上升子序列最大和)
- HDU 1087 Super Jumping! Jumping! Jumping!(DP,上升子序列)
- HDU 1087 Super Jumping! Jumping! Jumping!(dp最长上升子序列的和)
- Super Jumping! Jumping! Jumping! hdu1087 最长有序子序列
- HDU1087:Super Jumping! Jumping! Jumping!(DP)
- HDU1087 Super Jumping! Jumping! Jumping! 【DP】
- hdu1087 Super Jumping! Jumping! Jumping!(DP)
- hdu1087 Super Jumping! Jumping! Jumping!--DP
- hdu1087 - Super Jumping! Jumping! Jumping! (dp 求递增子序列的最大和)
- HDU1087 Super Jumping! Jumping! Jumping!(dp问题)
- Swift 3.0与C语言指针类型的桥接
- 从零开始学开发,从第一篇博客开始
- 2016年秋季校招面经(华为、腾讯、360、网易等)
- 数据结构学习笔记
- 10.3 基于多任务的并发服务器
- HDU1087:Super Jumping! Jumping! Jumping!(普通上升子序列 + dp)
- 算法训练 删除数组零元素
- Java三大框架
- 之字形打印矩阵
- 关于wordpress插件WP SMTP的邮箱设置
- [LeetCode]199. Binary Tree Right Side View
- P1781 宇宙总统
- 利用hosts跳过DNS
- 编译libcurl