首頁 > 資料庫 > mysql教程 > Codeforces Round #264 (div2)B. Caisa and Pylons

Codeforces Round #264 (div2)B. Caisa and Pylons

WBOY
發布: 2016-06-07 15:31:12
原創
1338 人瀏覽過

Caisa solved the problem with the sugar and now he is on the way back to home. Caisa is playing a mobile game during his path. There are ( n ??1) pylons numbered from 0 to n in this game. The pylon with number 0 has zero height, the pylon

Caisa solved the problem with the sugar and now he is on the way back to home.

Caisa is playing a mobile game during his path. There are (n?+?1) pylons numbered from 0 to n in this game. The pylon with number 0has zero height, the pylon with number i (i?>?0) has height hi. The goal of the game is to reach n-th pylon, and the only move the player can do is to jump from the current pylon (let's denote its number as k) to the next one (its number will be k?+?1). When the player have made such a move, its energy increases by hk?-?hk?+?1 (if this value is negative the player loses energy). The player must have non-negative amount of energy at any moment of the time.

Initially Caisa stand at 0 pylon and has 0 energy. The game provides a special opportunity: one can pay a single dollar and increase the height of anyone pylon by one. Caisa may use that opportunity several times, but he doesn't want to spend too much money. What is the minimal amount of money he must paid to reach the goal of the game?

相關標籤:
來源:php.cn
本網站聲明
本文內容由網友自願投稿,版權歸原作者所有。本站不承擔相應的法律責任。如發現涉嫌抄襲或侵權的內容,請聯絡admin@php.cn
熱門教學
更多>
最新下載
更多>
網站特效
網站源碼
網站素材
前端模板