Submission

Score: 100

User: SayRo

Problemset: Maximum Adjacent

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-04 20:20:51

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

int main(){
    vector<int> v,ans;
    cin.tie(nullptr)->sync_with_stdio(0);
    int x;
    while(cin>>x){
        v.push_back(x);
    }
    if(v.size()==1) cout<<v[0],exit(0);
    if(v.size()==2){
        if(v[0]>v[1]) cout<<v[0];
        else if(v[0]<v[1]) cout<<v[1];
        return 0;
    }
    for(int i=1;i<v.size()-1;i++){
        if(i==1&&v[0]>v[1]) ans.push_back(v[0]);
        else if(v[i]>v[i-1]&&v[i]>v[i+1]) ans.push_back(v[i]);
        if((i==v.size()-2)&&(v[v.size()-1]>v[v.size()-2])) ans.push_back(v[v.size()-1]);
    }
    for(auto z : ans){
        cout<<z<<" ";
    }
}