zoukankan      html  css  js  c++  java
  • 【dp专题】E

    E - Super Jumping! Jumping! Jumping!
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
    Submit Status

    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
     
     
    最长上升子序列。
    #include <iostream>
    #include <algorithm>
    #include <cstring>
    #include <cstdio>
    #include <cmath>
    
    using namespace std;
    
    int main()
    {
        int n,tmp,ans;
        const int N=1E3+5;
        int a[N],dp[N];
        while ( scanf("%d",&n)!=EOF&&n)
        {
            memset(a,0,sizeof(a));
            memset(dp,0,sizeof(dp));
            for ( int i = 1 ; i <= n ; i++ )
                scanf("%d",&a[i]);
            dp[1]=a[1];
            ans=dp[1];
            for ( int i = 2 ; i <= n ; i++ )
            {
                tmp = 0;
                for ( int j = 1 ; j <= i-1 ; j++ )
                    if ( a[j]<a[i]&&dp[j]>tmp)
                {
                    tmp=dp[j];
                }
                dp[i]=tmp+a[i];
                if ( dp[i]>ans ) ans = dp[i] ;
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    CentOS 6.5 编译安装Apache2.4
    Linux 服务器安全优化
    yum安装Apache2.4
    HDU 3308 线段树求区间最长连续上升子序列长度
    HDU 3607 线段树+DP+离散化
    POJ 3667 线段树区间合并裸题
    HDU 5726 线段树+dp
    牛客网多校训练第二场D Kth Minimum Clique
    HDU 4325 离散化+树状数组 或者 不使用树状数组
    HDU 2167 状压dp方格取数
  • 原文地址:https://www.cnblogs.com/111qqz/p/4394891.html
Copyright © 2011-2022 走看看