HDU 1087 最大递增字段和
2015-12-13 22:16
351 查看
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29444 Accepted Submission(s): 13141
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each case, print the maximum according to rules, and one line one case.
[align=left]Sample Input[/align]
3 1 3 2 4 1 2 3 4 4 3 3 2 1 0
[align=left]Sample Output[/align]
4 10 3 题意: 让求从左到右按递增的方式求最大的字段和(可以不连续)#include<bits/stdc++.h> using namespace std; long long int a[10000]; long long int dp[10000]; int main() { int n; while(~scanf("%d",&n)) { if(n==0) break; for(int i=0;i<n;i++) {scanf("%lld",&a[i]); dp[i]=a[i]; //初始状态 } for(int i=1;i<n;i++) { for(int j=0;j<i;j++) { if(a[i]>a[j]) dp[i]=max(dp[j]+a[i],dp[i]); } } long long int Max=0; for(int i=0;i<n;i++) Max=max(dp[i],Max); printf("%lld\n",Max); } return 0; }
相关文章推荐
- ReactJs入门介绍
- AngularJS 对象
- 互联网追梦第一人:90后福建潘华鹏的传媒人生
- C语言基础(二)
- 第一天
- [javase学习笔记]-5.2 数组的内存分配及特点
- 简读The Swift Programming Language官方文档--枚举
- Phone状态的监听机制
- ios CoreData NSManagedObject 生命周期
- 程序员必须软件
- 【leetcode题解】【E】【59】Reverse Bits
- 简读The Swift Programming Language官方文档--控制流
- 简读The Swift Programming Language官方文档--函数
- 心情随笔
- 【Tomcat】一分钟教你eclipse如何配置tomcat(二)
- wifi打开关闭工具类
- 算法学习:贪心解部分背包问题
- 简读The Swift Programming Language官方文档--集合类型
- [置顶] WPF执行后台任务时播放等待deon规划
- 【Tomcat】tomcat简单介绍,安装以及启动(一)