[알고리즘] 백준 2846 - 오르막길

#include <iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int inp, cur = 0, pre, Ans = 0;

    cin >> cur;
    pre = cur;

    for(int i=1; i<N; i++){
        cin >> inp;
        if(inp <= pre){
            cur = inp;
        }
        else{
            Ans = max(Ans, inp - cur);
        }
        pre = inp;
    }

    cout << Ans << "\n";

    return 0;
}