【HDU】1087 - Super Jumping! Jumping! Jumping!(dp)
2016-07-26 10:10
405 查看
点击打开题目
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 33314 Accepted Submission(s): 15063
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
Author
lcy
注意这道题可能有负值。
代码如下:
#include <cstdio>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
int main()
{
int dp[1011];
int num[1011];
int n;
int ans;
while (~scanf ("%d",&n) && n)
{
for (int i = 0 ; i < n ; i++)
scanf ("%d",&num[i]);
ans = -INF; //一定要考虑为负数的情况
for (int i = 0 ; i < n ; i++)
{
dp[i] = num[i];
for (int j = 0 ; j < i ; j++)
{
if (num[i] > num[j])
dp[i] = max (dp[i] , dp[j] + num[i]);
}
ans = max (ans , dp[i]);
}
printf ("%d\n",ans);
}
return 0;
}
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33314 Accepted Submission(s): 15063
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
Author
lcy
注意这道题可能有负值。
代码如下:
#include <cstdio>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
int main()
{
int dp[1011];
int num[1011];
int n;
int ans;
while (~scanf ("%d",&n) && n)
{
for (int i = 0 ; i < n ; i++)
scanf ("%d",&num[i]);
ans = -INF; //一定要考虑为负数的情况
for (int i = 0 ; i < n ; i++)
{
dp[i] = num[i];
for (int j = 0 ; j < i ; j++)
{
if (num[i] > num[j])
dp[i] = max (dp[i] , dp[j] + num[i]);
}
ans = max (ans , dp[i]);
}
printf ("%d\n",ans);
}
return 0;
}
相关文章推荐
- POJ1422
- Android提醒微技巧,你真的了解Dialog、Toast和Snackbar吗?
- Do not concatenate text displayed with setText. Use resource string with placeholders. 提示
- ReflectionToStringBuilder的使用分析与优化
- Scala入门到精通——第十四节 Case Class与模式匹配(一),scala入门到精通
- arm linux 移植usb转串口驱动
- 一颗核桃的逆袭之路
- 换个思维透透气
- NYOJ 151 Biorhythms --剩余定理
- Oracle - SQL学习笔记 1
- Android进程间通信之Socket
- mac上cocoaPods无法使用
- SVN实例
- Postgresql Dblink相关函数
- iOS视觉差Parallax效果简析
- Android二维码ZXing开源框架的学习总结
- git bash客户端添加node_modules目录时,遇到长路径提示file name too long的解决方案
- ORACLE 常用函数 日期/时间函数
- 内联函数
- HDU 2224 The shortest path (TSP模板)