3003
来源:互联网 发布:人才网站源码 编辑:程序博客网 时间:2024/05/22 03:18
3003
Problem C
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 86 Accepted Submission(s) : 35
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.<br><br><center><img src=/data/images/1087-1.jpg></center><br><br>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.<br>Your task is to output the maximum value according to the given chessmen list.<br>
Input
Input contains multiple test cases. Each test case is described in a line as follow:<br>N value_1 value_2 …value_N <br>It is guarantied that N is not more than 1000 and all value_i are in the range of 32-int.<br>A test case starting with 0 terminates the input and this test case is not to be processed.<br>
Output
For each case, print the maximum according to rules, and one line one case.<br>
Sample Input
3 1 3 24 1 2 3 44 3 3 2 10
Sample Output
4103
题意:
两个人玩棋,根据不同的跳跃路径,最后得到的结果最大的人获胜。
根本上来说就是求最大子序列的和的问题
两个人玩棋,根据不同的跳跃路径,最后得到的结果最大的人获胜。
根本上来说就是求最大子序列的和的问题
思路:
求最大子序列的和,就自然而然的想到动态规划问题;
状态方程为:
状态方程:sum[j]=max{sum[i]}+a[j]; 其中,0<=i<=j,a[i]<a[j]
AC代码:
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int a[1005],dp[1005];
const int inf = 999999999;
int main()
{
int n,i,t,m,j,ans;
while(~scanf("%d",&n),n)
{
memset(dp,0,sizeof(dp));
for(i = 1;i<=n;i++)
scanf("%d",&a[i]);
for(i = 1;i<=n;i++)
{
ans = -inf;
for(j = 0;j<i;j++)
{
if(a[i]>a[j])
ans = max(ans,dp[j]);
}
dp[i] = ans+a[i];
}
ans = -inf;
for(i = 0;i<=n;i++)
{
if(dp[i]>ans)
ans = dp[i];
}
printf("%d\n",ans);
}
return 0;
}
0 0
- 3003
- HDU 3003
- hdu 3003 背包
- HDU 3003 Pupu
- hdu 3003 快速幂取模
- HDU 3003 (二进制法)
- POJ 3003 解题报告
- hdu 3003 Pupu
- hdu 3003 Pupu
- BZOJ 3003: LED
- HDU 3003 (二进制法)
- hdu 3003 【二分快速幂】
- POJ 3003 Spiderman’s workout
- HDOJ Pupu 3003【快速幂】
- HDU——3003 Pupu
- 杭电 3003 Pupu(快速幂取余)
- HDU - 3003 - Pupu (快速幂取模!)
- 【hadoop】 3003-mapreduce任务的提交
- 函数指针浅谈
- leetcode 119
- 第3课:解密SparkStreaming运行机制和架构进阶之Job和容错
- 2016年ADAS行业发展潜力及行业发展趋势分析【图】
- java下操作ftp 上传下载创建文件夹
- 3003
- [Notes] 可持久化数据结构学习笔记
- 第4课:Spark Streaming事务处理彻底掌握
- Stage划分和Task最佳位置算法
- In-memory Computing with SAP HANA读书笔记 - 第七章:Business continuity and resiliency for SAP HANA
- 表单密码强度监测判断JS代码特效
- C++ 重载构造函数
- 第5课:基于案例一节课贯通Spark Streaming流计算框架的运行源码
- Linux 标准IO库 全缓冲、行缓冲、无缓冲