Submission

Score: 100

User: Patn01Z

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-09 21:38:50

#include <iostream>
#include <algorithm>
using namespace std;

int Lmax(int *h,int i){
    return *max_element(h,h+i);
}

int Rmax(int *h,int n,int i){
    return *max_element(h+i+1,h+n);
}

int main(){
    int n;
    cin >> n;
    int h[n]={0};
    for(int i=0;i<n;i++){
        cin >> h[i];
    }


    int water=0;
    for(int i=1;i<n-1;i++){
        int H=min(Lmax(h,i),Rmax(h,n,i));
        if(H>h[i]){
            water+=H-h[i];
        }
    }

    cout << water;
}