HDU---1087-Super Jumping! Jumping! Jumping!(DP)
2015-06-22 14:47
375 查看
Super Jumping! Jumping! Jumping!
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 19 Accepted Submission(s) : 6
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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.![](http://acm.hdu.edu.cn/data/images/1087-1.jpg)
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
Author
lcyACCODE:
最大递增子序列和
#include <iostream> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #include <limits.h> using namespace std; long long dp[10002]; int num[10002]; int main() { int n; while(cin>>n) { if(n==0)break; int i,j; memset(dp,0,sizeof(dp)); for(i=0; i<n; ++i) { scanf("%d",&num[i]); dp[i]=num[i]; for(j=0; j<i; ++j) { if(num[i]>num[j]) if(dp[i]<dp[j]+num[i]) dp[i]=dp[j]+num[i]; } } int mmax=INT_MIN; for(i=0; i<n; ++i) if(dp[i]>mmax)mmax=dp[i]; cout<<mmax<<endl; } return 0; }
相关文章推荐
- 页面加载的效果
- office2007在win7 64上空闲状态cpu消耗7-15%的解决方法
- Ubuntu下的PHP开发环境架设
- 体系结构复习5——仓库级计算机的并行
- 动态规划 最长公共子序列
- cordova学习四:事件Events
- 强制修改mysql 中root的密码
- Maven与Antx(整理)
- C语言中的undefined behavior
- Java-马士兵设计模式学习笔记-代理模式-动态代理 修改成可以任意修改代理逻辑
- jquery 使用$.ajax post方法提交数据
- 黑马程序员JAVA笔记4--继承
- zebra/quagga ospf and unh test section 4
- 一些PHP性能的优化
- cordova学习三:config.xml文件配置
- Java的一些概念整理
- 黑马day06 其他重要标签
- 30.改变学生结构体数组中的值
- mysql更新表中日期字段时间
- LeetCode | Divide Two Integers