zoukankan      html  css  js  c++  java
  • HDU1087 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): 32561    Accepted Submission(s): 14689

    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

     1 #include <iostream>
     2 #include <string.h>
     3 using namespace std;
     4 int dp[1111];
     5 int N,temp;
     6 int a[1111];
     7 //dp[j] = max{dp[i]}+temp;
     8 int main()
     9 {
    10     while(cin>>N,N){
    11         for(int i=0;i<N;i++)
    12             cin>>a[i];
    13         memset(dp,0,sizeof(dp));
    14         dp[0]=a[0];
    15 
    16         for(int i=1;i<N;i++){
    17             temp=0;
    18             for(int j=0;j<i;j++){
    19                  if(a[i]>a[j]){
    20                     temp = max(temp,dp[j]);
    21 
    22                  }
    23             }
    24             dp[i] = a[i] + temp;
    25         }
    26         temp=-1;
    27         for(int i=0;i<N;i++){
    28             if(temp<dp[i])
    29                 temp=dp[i];
    30         }
    31         cout<<temp<<endl;
    32     }
    33     return 0;
    34 }
  • 相关阅读:
    【转载】 KL距离(相对熵)
    HTML5动画软件工具编辑器 HTML5动画分类 工具推荐
    Flash Actionscript AS3 渐变透明 mask遮罩
    HTML动画分类 HTML5动画 SVG库 SVG工具 Canvas动画工具
    Flash:彻底理解crossdomain.xml、跨swf调用。
    Flash: Event.PASTE Flash获取剪贴板内容 触发paste事件 how to get paste event
    Flash:TextField字体不显示/文字不显示/文字丢失
    Flash 矢量图和位图性能对比 导出为位图/缓存为位图 export as bitmap / cache as bitmap
    验证码去噪 分离背景 分离文字 最大类间方差
    Flash XSS 漏洞详解 根治的好办法
  • 原文地址:https://www.cnblogs.com/asuml/p/5591817.html
Copyright © 2011-2022 走看看