Submission

PPPPPPPPPP

Score: 100

User: Dormon

Problemset: ปริมาตรน้ำท่วม

Language: cpp

Time: 0.002 second

Submitted On: 2024-12-11 18:12:51

#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <numeric>

#define debug(...) Debug(#__VA_ARGS__, __VA_ARGS__)
using namespace std;
const bool TEST_CASE = 0;

template<typename T>
typename std::enable_if<std::is_integral<T>::value>::type
Debug(const char* name, T value) {
    std::cout << name << " : " << value << '\n';
}

template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {
    for(auto &x : a) out << x << ' '; 
    return out;
};
template<typename T, typename... Args>
typename std::enable_if<std::is_integral<T>::value>::type
Debug(const char* names, T value, Args... args) {
    const char* comma = strchr(names, ',');
    std::cout.write(names, comma - names) << " : " << value << " | ";
    Debug(comma + 1, args...);
}

void solve(){
    int n;
    cin >> n;
    vector<int> a(n+2, 0), mxl(n+2, 0), mxr(n+2, 0);
    for (int i = 1;i <= n;i++){
        cin >> a[i];
        mxl[i] = max(a[i], mxl[i-1]);
    }    
    for (int i = n;i >= 1;i--)
        mxr[i] = max(a[i], mxr[i+1]);
    int ans = 0;
    for (int i = 1;i <= n;i++)
        ans += min(mxl[i], mxr[i]) - a[i];
    cout << ans << '\n';
}

int main()
{
    #ifndef DORMON
        ios_base::sync_with_stdio(0); 
    #endif
    cin.tie(0);
    int q = 1; 
    if (TEST_CASE) cin >> q;
    while (q--){
        solve();
    }
}