hduoj 1087
来源:互联网 发布:行政审批流程优化方案 编辑:程序博客网 时间:2024/04/29 13:57
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34427 Accepted Submission(s): 15632
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
题解:求和最大的上升序列。dp[i] = max{dp[j]+num[i]}(dp[i]是到第i个数时最大和).状态转移方程的意思就是 发现num[j]<num[i]时,把num[i]插入到终点为j的序列的最后一位,这样保证序列上升。
代码:
#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define MAXN 500000
#define INF 0x7fffffff
long long int dp[1100];
int num[1100];
int main()
{
int n;
while(cin >> n&&n)
{
long long int maxx = 0;
for(int i = 1;i <= n;i++) cin >> num[i];
for(int i = 1;i <= n;i++)
{
dp[i] = num[i];
for(int j = 1;j < i;j++)
{
if(num[j] < num[i] && dp[i] < dp[j]+num[i])
{
dp[i] = dp[j]+num[i];
}
}
maxx = max(dp[i],maxx);
}
cout << maxx << endl;
}
return 0;
}
#include<algorithm>
#include<iostream>
using namespace std;
#define MAXN 500000
#define INF 0x7fffffff
long long int dp[1100];
int num[1100];
int main()
{
int n;
while(cin >> n&&n)
{
long long int maxx = 0;
for(int i = 1;i <= n;i++) cin >> num[i];
for(int i = 1;i <= n;i++)
{
dp[i] = num[i];
for(int j = 1;j < i;j++)
{
if(num[j] < num[i] && dp[i] < dp[j]+num[i])
{
dp[i] = dp[j]+num[i];
}
}
maxx = max(dp[i],maxx);
}
cout << maxx << endl;
}
return 0;
}
0 0
- hduoj 1087
- HDUOJ 1087
- HDUOJ
- HDUoj
- hduoj 1087 数塔【动态规划】
- HDUOJ 2050
- HDUOJ 2018
- HDUOJ 2069
- HDUOJ 1303
- HDUOJ 2031
- HDUOJ 2047
- HDUOJ 2089
- hduoj 1708
- hduoj 2031
- hduoj 2032
- hduoj 1062
- HDUOJ 1039
- HDUOJ lines
- 312. Burst Balloons
- Eclipse 快捷键
- 从零开始写设备树DTS
- 保护花朵
- codeforces 348B B. Apple Tree(dfs+数论)
- hduoj 1087
- 洛谷 P1273 有线电视网
- HDU 3549 Flow Problem(网络流水题【Edmond-Karp算法】)
- 浅谈μCOS-III关于系统延时函数
- [UVa] 465 - Overflow
- 部分枚举(废料堆,uva 10755)
- linux proc文件创建指南
- Java知识碎片整理(4)——抽象类
- linux下(以ubuntu为例)安装微信