hdu 1087 动态规划之最长上升子序列
http://acm.hdu.edu.cn/showproblem.php?pid=1087
 |
||||||||||||||||
|
||||||||||||||||
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) 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. 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 Author
lcy
Recommend
|
||||||||||||||||
#include<stdio.h>
#define N 1001
int dp[N];
int value[N];
int n,max;
int main()
{
int i,j;
while(scanf("%d",&n)!=EOF&&n)
{
for(i=; i<n; i++)
{
scanf("%d",&value[i]);
}
dp[]=max=value[];
for(i=; i<n; i++)
{
dp[i]=value[i];
for(j=; j<i; j++)
{
if(value[i]>value[j])
{
if(dp[i]<dp[j]+value[i])//动态规划的精髓是把问题分成子问题，这样，因为j<i，那么dp[j]一定是一个上升序列
dp[i]=dp[j]+value[i];
}
}
if(dp[i]>max)
max=dp[i];
}
printf("%d\n",max);
}
return ;
}
最新文章
- 学习ios【2】Objective-C 数字和字符串
- 《Effective Java》—— 对于所有对象都通用的方法
- CSharp Similarities and Differences
- Swift 2.0 到底「新」在哪？
- 【疯狂Java学习笔记】【第一章：Java语言概述】
- [iOS基础控件 - 6.8] 各种数据类型的@property属性
- 电脑远程控制手机2—webkey
- php session 读写锁
- Spring框架入门之Spring简介
- Docker 备份、恢复、迁移数据卷
- Microsoft Dynamics CRM 9.0 OP 版本 安装 的那些 雷
- kafka consumer 0.8.2.1示例代码
- python之 类对象 类方法 实例对象 实例方法 静态方法
- Ubuntu16.04之安装Nutch
- selenium+python爬虫环境搭建
- Getting started with C# and GDAL
- jira-6.0.1-x64下载地址
- MapReduce原理1
- wps 根据单元格值 设置单元格所在行 颜色(大于0 行红色 小于0 行xx色)
- 51nod 1106 质数检测