Submission

Status:

[PP-SSSSSSS]

Score: 0

User: detectives_conan

Problemset: stock

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-26 21:11:36

#include<bits/stdc++.h>

using namespace std;

int n,val[100001],q,qs[100001];

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i = 1; i<=n; ++i){
        cin >> val[i];
        qs[i] = qs[i-1] + max(0, val[i] - val[i-1]);
    }
    cout << qs[n] - qs[1];
}