• <input id="auww4"></input>
  • <input id="auww4"><acronym id="auww4"></acronym></input>
  • <input id="auww4"><u id="auww4"></u></input>
    <object id="auww4"><acronym id="auww4"></acronym></object>
    <menu id="auww4"></menu><input id="auww4"><u id="auww4"></u></input>
    <input id="auww4"><u id="auww4"></u></input>
  • F.A.Q
    Hand In Hand
    Online Acmers
    Forum | Discuss
    Statistical Charts
    Problem Archive
    Realtime Judge Status
    Authors Ranklist
         C/C++/Java Exams     
    ACM Steps
    Go to Job
    Contest LiveCast
    Best Coder beta
    VIP | STD Contests
    Virtual Contests
        DIY | Web-DIY beta
    Recent Contests
    Author ID 
     Register new ID

    Super Jumping! Jumping! Jumping!

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

    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Ł¨Ćĺ±PŁ©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 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.

    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



    Statistic | Submit | Discuss | Note
    Hangzhou Dianzi University Online Judge 3.0
    Copyright © 2005-2020 HDU ACM Team. All Rights Reserved.
    Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
    Total 0.000000(s) query 2, Server time : 2020-11-09 02:29:11, Gzip enabled