zoukankan      html  css  js  c++  java
  • HDOJ --- Super Jumping! Jumping! Jumping!

    Super Jumping! Jumping! Jumping!

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


    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

     DP 水题,暴力DP。

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<climits>
     4 #include<cstring>
     5 #define MAX 1111
     6 using namespace std;
     7 long long int dp[MAX], temp[MAX], ans;
     8 int main(){
     9     int n;
    10     while(~scanf("%d", &n) && n){
    11         memset(dp, 0, sizeof(dp));
    12         ans = -1;
    13         for(int i = 1;i <= n;i ++){
    14             scanf("%lld", &temp[i]);
    15             for(int j = 0;j < i;j ++)
    16                 if(temp[i] > temp[j]) dp[i] = max(dp[j]+temp[i], dp[i]);
    17             ans = max(ans, dp[i]);
    18         }
    19         printf("%lld
    ", ans);
    20     }
    21 }
  • 相关阅读:
    注册表解锁
    Windows错误代码大全 2
    硬盘数据线的问题
    vs2010与C#4.0新特性
    (转载)C语言负数的移位运算
    (转载)看C语言编码转换负数的二进制表示方法
    (转载)C语言右移运算符的问题(特别当与取反运算符一起时)
    (转载)Qt中使用cout输出的方法
    (转载)QPainter的用法
    (转载)Qt计算MD5
  • 原文地址:https://www.cnblogs.com/anhuizhiye/p/3638764.html
Copyright © 2011-2022 走看看