acm_Jumping

原创 2016年05月30日 11:10:18

题目:

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 2 4 1 2 3 4 4 3 3 2 1 0
 

Sample Output
4 10 3
 

想法:

就是求最长子序列呗,前面写过这样的,就不多说了。。


代码:

#include<iostream>
#include<string>
using namespace std;
int inline max(int a,int b)
{
return a>b?a:b;
}
int main()
{
int i,t,j,dp[1001],a[1001];
    while(cin>>t&&t!=0)
    {
for(i=1;i<=t;i++)
        {
            cin>>a[i];
            dp[i]=a[i];
        }
        for(i=1;i<=t;i++)
        {
            for(j=1;j<i;j++)
            {
                if(a[i]>a[j])
                    dp[i]=max(dp[i],dp[j]+a[i]);
            }
        }
        int sum=0;
        for(int i=0;i<=t;i++)
            sum=max(sum,dp[i]);
cout<<sum<<endl;
    }
    return 0;
}

相关文章推荐

Jumping into C++ 无水印pdf

  • 2017年09月23日 00:49
  • 4.21MB
  • 下载

Jumping_into_c++

  • 2012年03月22日 21:59
  • 1.8MB
  • 下载

Codeforces 725 A Jumping Ball【水题】

A. Jumping Ball time limit per test 2 seconds memory limit per test 256 megabytes input ...

Jumping Into C++

  • 2013年05月25日 16:28
  • 5.67MB
  • 下载

Jumping into C++

  • 2014年02月24日 19:55
  • 4.79MB
  • 下载

【codeforces 510D】Fox And Jumping

【题目链接】:http://codeforces.com/contest/510/problem/D【题意】 你可以买n种卡片; 每种卡片的花费对应c[i]; 当你拥有了第i种卡片之后; ...

CSUOJ 1843 Jumping Monkey BFS,状态压缩

CSUOJ 1843 Jumping Monkey          题目大意:有一个n个点的图,对手可以在图上的任意一个点放下一个物品,你每一次有机会查看一个点上是否存在物品,假若你查看之后点内没有...

SpriteKit官方文档翻译和学习(二)---Jumping into Sprite Kit

深入SpriteKit 学习Sprite Kit最好的途径是实战,下面通过一个例子来初探SpriteKit。通过这个例子,你将会学到以下内容: 在一个以SpriteKit框架为基础的游戏中使用场...

codeforces 510D Fox And Jumping

题意 大概是 你现在在X坐标轴上0点 ,现在你有N个魔法,第i   个魔法的魔法效果 就是 让你学会 跳 L[ i ]  这么长的距离,学习这个魔法 花费 C[i], 现在 你想花费最少的钱,使得你...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:acm_Jumping
举报原因:
原因补充:

(最多只允许输入30个字)