杭电HDU1087
来源:互联网 发布:mac微信语音导出软件 编辑:程序博客网 时间:2024/05/01 06:25
Super Jumping! Jumping! Jumping!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 28874 Accepted Submission(s): 12893
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
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[100000];
int dp[100000];
int main()
{
int t;
while(~scanf("%d",&t))
{
if(t==0)break;
int i,j;
memset(dp,0,sizeof(dp));
memset(a,0,sizeof(a));
for(int i=1;i<=t;i++)
scanf("%d",&a[i]);
dp[1]=a[1];
for(int i=2;i<=t;i++)
{
for(int j=i-1;j>=0;j--)
{
if(a[i]>a[j])
{
dp[i]=max(dp[i],dp[j]+a[i]);
}
}
}
sort(dp+1,dp+1+t);
printf("%d\n",dp[t]);
}
}
- 杭电HDU1087
- hdu1087
- hdu1087
- HDU1087
- HDU1087
- hdu1087
- hdu1087
- hdu1087
- hdu1087
- hdu1087
- HDU1087
- hdu1087
- hdu1087
- hdu1087
- hdu1087
- hdu1087
- HDU1087
- HDU1087
- WIN32 API 打开大于10序号的串口注意写法
- 如何实现百度mapv开源库与ol3的结合
- 【并查集】:poj2524,Ubiquitous Religions
- C# 任意形状按钮控件 实现简单实用
- android 获取WebView的网页高度
- 杭电HDU1087
- java.lang.NoClassDefFoundError的几种原因与解决方法
- 异常总结,持续更新
- ContextLoaderListener(1)---WebApplicationContext创建过程
- 实习整理(十六)
- spinner的使用
- C的形参和实参的关系
- selenium自动化测试实现对网站的登陆(使用java编写)
- Ring实现原理剖析