codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

463B.md (1796B)


      1 Source: https://codeforces.com/problemset/problem/463/B
      2 
      3 B. Caisa and Pylons
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 Caisa solved the problem with the sugar and now he is on the way back to home.
     22 
     23 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 with number *i* (*i* > 0) has height *h**i*. 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 *h**k* - *h**k* + 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.
     24 
     25 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?
     26 
     27 Input
     28 
     29 The first line contains integer *n* (1 ≤ *n* ≤ 105). The next line contains *n* integers *h*1, *h*2, ..., *h**n* (1  ≤  *h**i*  ≤  105) representing the heights of the pylons.
     30 
     31 Output
     32 
     33 Print a single number representing the minimum number of dollars paid by Caisa.
     34 
     35 Examples
     36 
     37 Input
     38 
     39 ```
     40 5  
     41 3 4 3 2 4
     42 ```
     43 
     44 Output
     45 
     46 ```
     47 4
     48 ```
     49 
     50 Input
     51 
     52 ```
     53 3  
     54 4 4 4
     55 ```
     56 
     57 Output
     58 
     59 ```
     60 4
     61 ```
     62 
     63 Note
     64 
     65 In the first sample he can pay 4 dollars and increase the height of pylon with number 0 by 4 units. Then he can safely pass to the last pylon.