这是一道关于超级跳跃棋盘游戏的问题，玩家从起点开始，必须跳跃到终点，每次跳跃都必须跳到数值更大的棋子上。目标是找到能获得最大得分的跳跃路径。输入包含多组数据，每组数据表示棋盘上的棋子数量及其数值，最后一组数据为0。输出每组数据的最大得分。题目提示使用动态规划求解，注意不能返回起点。
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 c
最低0.47元/天 解锁文章
1020
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
