Submission

PPPPPPPPPP

Score: 100

User: spy

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

Language: cpp

Time: 0.002 second

Submitted On: 2024-11-25 14:25:10

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

int main(){
    int n;
    cin>>n;
    int keep[n];
    for(int i=0;i<n;i++){
        cin>>keep[i];
    }
    int l[n],r[n];
    l[0] = keep[0];
    r[n-1] = keep[n-1];
    for(int i=1;i<n;i++){
        l[i] = max(l[i-1],keep[i]);
    }
    for(int i=n-2;i>=0;i--){
        r[i] = max(r[i+1],keep[i]);
    }
    int ans = 0;
    for(int i=0;i<n;i++){
        ans+=min(l[i],r[i])-keep[i];
    }
    cout<<ans;
}