HDU1087 噜啦啦卢

《部分递增最优解》

杭电1087
…///求上升子序列的最大和
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.
…
样本输入
3 1 3 2
4 1 2 3 4
4 3 3 2 1
0

样本输出
4
10
3
…
代码啦啦啦
#include
#include <math.h>
#include <stdio.h>
#include <string.h>

using namespace std;

int main()//递增最优解
{
int n,a[1005],dp[1005],sum;
int i,j;
while(scanf("%d",&n)!=EOF&&n!=0)
{
sum=0;
memset(dp,0,sizeof(dp));///初始化

    for(i=0;i<n;i++){scanf("%d",&a[i]);}dp[0]=a[0];sum=a[0];for(i=0;i<n;i++){for(j=0;j<i;j++){if(a[i]>a[j]){dp[i]=max(dp[i],dp[j]+a[i]);}///选择最优解，也就是最大值}dp[i]=max(dp[i],a[i]);sum=max(sum,dp[i]);///再次筛选最大值}cout << sum << endl;}
return 0;

}

HDU1087 噜啦啦卢相关推荐

美国微生物科学院22年院士公布！舒跃龙、黄力、卢洪洲、赵国屏！
作为世界上历史悠久的生命科学组织"美国微生物学会(American Society of Microbiology,ASM)"的下设机构之一,美国微生物科学院处于国际微生物科学的前 ...
培育强人工智能的「ImageNet」：上海交大卢策吾组提出铰接物体知识库 AKB-48
来源:前沿科技编译:OGAI 编辑:陈彩娴 ImageNet 的出现极大推动了计算机视觉领域的发展.在通往强人工智能的路上,我们还需要考虑物体的外观.结构.物理性质.语义等因素.为此,上海交大卢策吾 ...
崛起的超级智能：是否会是下一个“麦克卢汉式”预言？
腾讯科技 21世纪以来,前沿科技领域呈爆发式增长:从云计算到区块链.从谷歌大脑到华为EI智能体.从工业大脑到农业大脑.从城市神经网络到智慧社会--各种新技术和新概念层出不穷,如潮水般不断涌现,无论业界 ...
卢松松：如何复制暴利产品
在<网赚能否复制>这一文章中,我曾经介绍过阿俊做的AD收腹运动机这一款产品,这次我来详细讲描述一下如何复制暴利产品,希望大家能举一反三,本文仅供参考: 复制一款竞价页具体的一些技术知识我 ...
20155222卢梓杰课堂测试ch06补做
20155222卢梓杰课堂测试ch06补做 1.下面代码中,对数组x填充后,采用直接映射高速缓存,所有对x和y引用的命中率为() A . 1 B . 1/4 C . 1/2 D . 3/4 正确答案 ...
专访卢政：TSF如何助力企业微服务开发
12月15日,腾讯云+社区开发者大会在北京举行,腾讯云微服务平台产品负责人卢政在大会上做了<腾讯云TSF平台ServiceMesh最佳实践>的分享,在大会上,InfoQ记者对卢政进行了采访 ...
版本变迁_冰枪？卢登？大天使？——从发条魔灵的装备变迁看版本变动
文章出自 @英雄联盟所属官方英雄联盟专栏瓦罗兰文艺复兴联合会 @龙牙专栏作者所产出的内容均为个人投稿,不代表官方的任何立场大家好,这里是龙牙~ 当我们提起发条魔灵的时候,我们都会想到什么? ...
直播 | 华为云卢栋才：对话机器人的应用实践和最新进展
「PW Live」是由 PaperWeekly 和 biendata 共同发起的学术直播间,旨在帮助更多的青年学者宣传其最新科研成果.我们一直认为,单向地输出知识并不是一个最好的方式,而有效地反馈和交 ...
OTT交付如何超越传统广电交付，为用户带来高质量视频网络——对话Synamedia流媒体技术发展经理卢彦林...
编者按: Synamedia是一家专门为付费电视运营商提供端到端解决方案的公司,在全球范围内拥有众多知名客户.每天有一亿用户通过Synamedia产品搭建的网络收看一百多万个视频广播节目.LiveVi ...

HDU1087 噜啦啦卢

《部分递增最优解》

HDU1087 噜啦啦卢相关推荐

最新文章

热门文章