【HDU-1087】Super Jumping! Jumping! Jumping!
来源:互联网 发布:多玩我的世界盒子js 编辑:程序博客网 时间:2024/04/30 01:05
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
题目大意
第一个数为n,接下来为长度为n的序列,求这个序列的最大上升子序列。
思路
第一次做理解错题意了,以为是求最大上升子串,定义一个中间变量tmp求1~i的最大子序列和,状态转移方程:
dp[i]=tmp+num[i];
代码
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=1000+5;int num[maxn],dp[maxn],n;int main(){ while(~scanf("%d",&n)&&n) { memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) { scanf("%d",&num[i]); } int maxx=-1,tmp; for(int i=1;i<=n;i++) { tmp=-1; for(int j=0;j<i;j++) { if(num[i]>num[j]) tmp=tmp<dp[j]?dp[j]:tmp; } dp[i]=tmp+num[i]; if(dp[i]>maxx) maxx=dp[i]; } printf("%d\n",maxx); } return 0;}
- hdu/hdoj 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!
- 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!
- 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
- 蓝桥杯 算法训练 字串统计 (字符串、枚举)
- Runtime方法的使用和他的好基友Process的使用方法
- 第一次上机实践 项目2 就那胖子说事
- 购买记录
- 正则表达式
- 【HDU-1087】Super Jumping! Jumping! Jumping!
- bzoj2337 XOR路径 高斯消元
- 关于指针作函数参数
- TTL、RS232、CMOS电平
- 算法 for_each
- HDU 1269 迷宫城堡 强联通分量模板存放处
- 关于System类的使用方法【小程序】
- [Offer收割]编程练习赛1 hihocoder 1270 建造基地 (完全背包)
- 进程间通信——管道