Submission

PPPPPP-PP-

Score: 80

User: namnueng_good

Problemset: Maximum Adjacent

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-25 08:42:05

#include <bits/stdc++.h>
using namespace std;
int n,l;
vector<int> v;

int main() {
    cin.tie(NULL)->sync_with_stdio(false);
    while(cin>>n){
        v.push_back(n);
    }for(int i=1;i<v.size();i++){
        l=0;
        if(i==1&&v[i-1+l]>v[i+l]){
            cout<<v[i-1+l]<<' ';
        }
        while(v[i+l]>v[i-1+l]){
            l++;
            if(v[i+l]<=v[i-1+l]){
                cout<<v[i-1+l]<<' ';
                i+=l;
                break;
            }
        }
    }
}