HDU--dp练习--1008--Super Jumping! Jumping! Jumping!
来源:互联网 发布:卖家淘宝店铺修改名字 编辑:程序博客网 时间:2024/06/07 02:34
题目:
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.
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.
3 1 3 24 1 2 3 44 3 3 2 10
4103
说白了就是求最大上升子序列的和
源代码:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int dp[100005],i,j,n,num[100005];
while (cin >> n)
{
if (n == 0)
break;
memset(dp,0,sizeof(dp));
memset(num,0,sizeof(num));
for (i = 0; i < n; i++)
cin >> num[i];
dp[0] = num[0];
for (i = 0; i < n; i++)
{
int max = 0;
for (j = 0; j < i; j++)
{
if (num[j] < num[i])
if (max < dp[j])
max = dp[j];
}
dp[i] = num[i] + max;
}
int max = 0;
for (i = 0; i < n; i++)
if (max < dp[i])
max = dp[i];
cout << max << endl;
}
return 0;
}
- HDU--dp练习--1008--Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping! DP
- HDU - Super Jumping! Jumping! Jumping!(dp)
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- hdu 1087 Super Jumping! Jumping! Jumping! ----dp
- HDU 1087 Super Jumping! Jumping! Jumping!(dp)
- Super Jumping! Jumping! Jumping! -HDU 1087 dp
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- [HDU 1087 Super Jumping! Jumping! Jumping!] DP
- DP-HDU-1087-Super Jumping!Jumping!Jumping!
- HDU-1087-DP-Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- hdu 1087 Super Jumping! Jumping! Jumping! dp
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- hdu Super Jumping! Jumping! Jumping!(DP)
- Python3教程Web开发实战梳理-day4(编写Model)
- HDU 1069 Monkey and Banana (动态规划+LIS)
- 计算机硬盘容量关系
- MFC的简单使用(加法器的实现)
- 如何用jquery实现点击后跳到页面指定位置
- HDU--dp练习--1008--Super Jumping! Jumping! Jumping!
- 常用adb命令
- 奇数幻方
- java反射机制详解 及 Method.invoke解释 getMethod
- Python学习1
- Floyd,Dijkstra的详解
- get传参 有特殊字符 比如+ 会变为空格
- Linux 3.14的设备树-ARM架构-4412平台,最详细的实战开发代码(二)
- struts2上传实例