Submission

Score: 100

User: navysrimuang

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-15 16:04:03

#include<bits/stdc++.h>
#define endl '\n'
using namespace std;


int main(){

    int n;cin >>n;
    vector<int>v(n);
    for(int i = 0;i<n;i++){
        cin >> v[i];
    }
    
    int sum = 0;

    for(int i = 1;i<n-1;i++){

        int lmax = 0,rmax = 0;

        //search left
        for(int j=0;j<i;j++){
            if(v[j]>lmax){
                lmax = v[j];
            }
        }

        //search right
        for(int j = i+1;j<n;j++){
            if(v[j] > rmax){
                rmax = v[j];
            }
        }

        int mn = min(lmax,rmax);
        if(v[i] < mn){
            
            sum += mn - v[i];
        }

    }

    cout << sum << endl;



    return 0;
}


/*
alg that work
search maxfind mx left mx right
fil




*/