zoukankan      html  css  js  c++  java
  • HDU1087(dp)

    Super Jumping! Jumping! Jumping!

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


    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
     

     最长上升子序列,数据小,n2做法

     1 //2016.10.7
     2 #include <iostream>
     3 #include <cstdio>
     4 #include <cstring>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 const int N = 1005;
     9 long long arr[N], dp[N];
    10 
    11 int main()
    12 {
    13     int n;
    14     long long ans;
    15     while(scanf("%d", &n)!=EOF && n)
    16     {
    17         ans = 0;
    18         for(int i = 0; i < n; i++)
    19               scanf("%lld", &arr[i]);
    20         memset(dp, 0, sizeof(dp));
    21         for(int i = 0; i < n; i++)
    22         {
    23             dp[i] = arr[i];
    24             for(int j = 0; j < i; j++)
    25                   if(arr[i] > arr[j])
    26                       dp[i] = max(dp[i], dp[j]+arr[i]);//状态转移方程
    27             ans = max(ans, dp[i]);
    28         }
    29         printf("%lld
    ", ans);
    30     }
    31 
    32     return 0;
    33 }
  • 相关阅读:
    Mybatis实现简单的数据库增删改查操作
    MySQL压缩版安装配置教程
    ClassLoader简单教程
    Javascript Duff装置 循环展开(Javascript Loop unrolling Duff device)
    Visual Studio warning MSB3270:There was a mismatch between the processor architecture of the project being built "MSIL"
    Register/unregister a dll to GAC
    sign a third-party dll which don't have a strong name
    SQL Server(SSIS package) call .net DLL
    the convertion between string and BlobColumn
    bulk insert data into database with table type .net
  • 原文地址:https://www.cnblogs.com/Penn000/p/5936936.html
Copyright © 2011-2022 走看看