A35 贪心算法 P1969 [NOIP2013 提高组] 积木大赛

#include <bits/stdc++.h>
using namespace std;

int n, a, last = 0, ans = 0;

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a;
        if (a > last) ans += (a - last);
        last = a;
    }
    cout << ans << endl;
    return 0;
}