zoukankan      html  css  js  c++  java
  • hdu1087(求最大上升子列和 )

    Super Jumping! Jumping! Jumping!

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 43287    Accepted Submission(s): 20019


    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
     
    分析:动态规划求最大递增子列。考虑数a[i]的决策,
    dp[i]为以a[i]结尾的最大递增子列和 ,
    dp[i]=a[i];if(a[j]<a[i]) dp[i]=max(dp[j]+a[i],dp[i]); (0<=j<i)
     
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    using namespace std;
    int a[2000],dp[2000];
    int main()
    {
        int N; 
        while(scanf("%d",&N)&&N)
        {
            for(int i=0;i<N;i++) scanf("%d",&a[i]);
            memset(dp,0,sizeof(dp));
            int ans=a[0];
            dp[0]=a[0];
            for(int i=1;i<N;i++)
            {
                dp[i]=a[i];
                for(int j=0;j<i;j++)
                    if(a[j]<a[i]) dp[i]=max(dp[j]+a[i],dp[i]);
                ans=max(ans,dp[i]);
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
    View Code
  • 相关阅读:
    HDU 2809 God of War(DP + 状态压缩)
    POJ 3311 Hie with the Pie(DP状态压缩+最短路径)
    HDU 1400 (POJ 2411 ZOJ 1100)Mondriaan's Dream(DP + 状态压缩)
    位运算的应用
    ZOJ 3471 Most Powerful(DP + 状态压缩)
    POJ 2039 To and Fro(模拟)
    UVA 10817 Headmaster's Headache(DP +状态压缩)
    黑子的篮球
    POJ 1564(HDU 1258 ZOJ 1711) Sum It Up(DFS)
    HDU 3006 The Number of set(位运算 状态压缩)
  • 原文地址:https://www.cnblogs.com/ACRykl/p/8290350.html
Copyright © 2011-2022 走看看