zoukankan      html  css  js  c++  java
  • HDU 1087 Super Jumping! Jumping! Jumping!(动态规划)

    Super Jumping! Jumping! Jumping!

    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 2
    4 1 2 3 4
    4 3 3 2 1
    0
     
    Sample Output
    4
    10
    3
     
    题目大意:求出序列从左到右,满足下一个数比上一个数大的条件,的最大序列和。
     
    代码如下:
     1 # include <iostream>
     2 # include<cstdio>
     3 # define LL long long
     4 using namespace std;
     5 
     6 int main()
     7 {
     8     int n,ans,max,i,j;
     9     int s[1005],a[1005];    //s[i]表示最末尾是a[i]这个数的结果
    10     bool flag;
    11     while(scanf("%d",&n)&& n)
    12     {
    13         for(i=0; i<n; i++)
    14         {
    15             scanf("%d",&a[i]);
    16             s[i] = 0;
    17         }
    18         s[0] = a[0];
    19         for(i=1; i<n; i++)
    20         {
    21             s[i] = a[i];
    22             for(j=0; j<i; j++)
    23             {
    24                 if(a[i]>a[j] && s[j]+a[i]>s[i])
    25                 {
    26                     s[i] = s[j] + a[i];
    27                 }
    28             }
    29         }
    30         max = 0;
    31         for(i=0;i<n;i++)
    32         {
    33             if(s[i]>max)
    34             max = s[i];
    35         }
    36         printf("%d
    ",max);
    37     }
    38     return 0;
    39 }
  • 相关阅读:
    3. docker-compose实战--ghost app
    3. nacos服务发现
    1. nacos初识, 和eureka的比较, 在docker上安装nacos
    2.nacos服务配置中心
    如何将PHP对象数组转换成普通数组
    php 通过变量 来调用函数
    linux svn
    Sublime text 3安装svn插件
    php 字符串 定界符 json_last_error()
    centos7 rm -rf 删除文件的找回
  • 原文地址:https://www.cnblogs.com/acm-bingzi/p/3621499.html
Copyright © 2011-2022 走看看