hdu1087 Super Jumping! Jumping! Jumping!--DP
发布日期:2021-10-03 20:31:51
浏览次数:2
分类:技术文章
本文共 2340 字,大约阅读时间需要 7 分钟。
原题链接:
一:原题内容
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 24 1 2 3 44 3 3 2 10
Sample Output
4103
二:分析理解
一个简单的动态规划,起初理解成一个最大连续递增子序列,结果错了,题意: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.这句话。后来改了下,加个dp数组,其中dp[i]表示以a[i]结尾的最大分数。
三:AC代码
#include#include #include using namespace std;int a[1010];int dp[1010];int main(){ int N; while (scanf("%d", &N) && N) { for (int i = 0; i < N; i++) scanf("%d", &a[i]); int max = a[0]; dp[0] = a[0]; for (int i = 1; i < N; i++)//求出dp[1]到dp[N-1] { dp[i] = a[i]; for (int j = 0; j < i; j++)//求出dp[i] { if (a[j] < a[i]) if (dp[j] + a[i]>dp[i]) dp[i] = dp[j] + a[i]; } if (dp[i] > max) max = dp[i]; } printf("%d\n", max); } return 0;}
转载地址:https://blog.csdn.net/LaoJiu_/article/details/50936369 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!
发表评论
最新留言
表示我来过!
[***.240.166.169]2024年04月06日 07时13分15秒
关于作者
喝酒易醉,品茶养心,人生如梦,品茶悟道,何以解忧?唯有杜康!
-- 愿君每日到此一游!
推荐文章
WGAN
2019-04-26
调解算法参数2
2019-04-26
调节学习率的不同策略
2019-04-26
np.ascontiguousarray(array)
2019-04-26
from scipy import misc 读取和保存图片
2019-04-26
关于Batch Normalization
2019-04-26
关于PGGAN
2019-04-26
后台挂起,让服务器运行,客户端崩溃也可以继续运行
2019-04-26
SQL中的token含义
2019-04-26
网络的权重初始化示例
2019-04-26
python的各种推导式
2019-04-26
集合的运算关系
2019-04-26
Python的位置参数、默认参数、可变参数(*args)、关键字参数(**kwargs)
2019-04-26
匿名函数lambda
2019-04-26
git上传代码到远程仓库的命令行步骤
2019-04-26
Android解决网络加载大图片OOM的问题
2019-04-26
设计模式之单例模式
2019-04-26