英语题翻译9

Super Jumping! Jumping! Jumping! | JXNUOJ

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 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.

翻译:

如今,一种名为Super Jumping! Jumping! Jumping!的棋类游戏在HDU非常流行。也许你是一个好孩子,并且对这个游戏了解很少,所以我现在给你介绍一下。这个游戏可以由两个或两个以上的玩家一起玩。它由一个棋盘和一些棋子组成。并且所有棋子都被一个正整数或"start"或"end"标记。玩家从起点出发,最后必须跳到终点。在跳跃的过程中,玩家将会访问路径上的棋子,但是每人必须从一个棋子跳到另一个更大的棋子(你可以假设起点是最小值而且终点是最大值)。并且所有玩家不能后退。一次跳跃可以从一个棋子跳到下一个棋子,也可以跨越多个棋子,甚至可以从起点直接到达终点。当然,在这种情况下你会得到零分。当且仅当根据他的解决方案可以得到更高的分数,玩家才是赢家。注意,你的分数来自你在跳跃路径里棋子值的和。你的任务是根据给定的棋子列表输出最大值。

输入包含多个测试用例。每个测试用例在一行中描述如下:N value_1 value_2...value_N。保证 N 不大于 1000 且所有 value_i 都在 32-int 范围内。以0开始的测试用例会终止输入,且这个测试用例不会被处理。

对每一个测试用例,根据规则打印最大值,一个测试用例一行。

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值