zoukankan      html  css  js  c++  java
  • HDU1087:Super Jumping! Jumping! Jumping!(DP)

    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
     


     

    题意:其实就是最大递增子段和

    思路:状态方程:sum[j]=max{sum[i]}+a[j]; 其中,0<=i<=j,a[i]<a[j]   

    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    using namespace std;
    
    int a[1005],dp[1005];
    const int inf = 999999999;
    
    int main()
    {
        int n,i,t,m,j,ans;
        while(~scanf("%d",&n),n)
        {
            memset(dp,0,sizeof(dp));
            for(i = 1;i<=n;i++)
            scanf("%d",&a[i]);
            for(i = 1;i<=n;i++)
            {
                ans = -inf;
                for(j = 0;j<i;j++)
                {
                    if(a[i]>a[j])
                    ans = max(ans,dp[j]);
                }
                dp[i] = ans+a[i];
            }
            ans = -inf;
            for(i = 0;i<=n;i++)
            {
                if(dp[i]>ans)
                ans = dp[i];
            }
            printf("%d
    ",ans);
        }
    
        return 0;
    }
    


     

  • 相关阅读:
    FFmpeg软件只是个解码编码软件,如果支持多种格式必须先安装好对应的库,下面就说下我装的库
    在Centos 6.5 X64下切割m3u8
    扩展自己的数组核心库
    关于小周同志在消息模块定位功能修改时存在的问题分析
    比对两个Word文件内容是否一致的C#解决办法
    如何实现artTemplate模板的可重用性,以此框架打造自己的自定义组件
    稍微谈一下 javascript 开发中的 MVC 模式
    Node.js 函数
    Node.js模块系统
    Node.js Stream(流)
  • 原文地址:https://www.cnblogs.com/riskyer/p/3283507.html
Copyright © 2011-2022 走看看