Submission

PPPPPPPPPP

Score: 100

User: lobatza

Problemset: Maximum Adjacent

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-19 05:24:26

#include<bits/stdc++.h>
using namespace std;
vector<vector<pair<int,int> > > g(5);
int main(){
	int a;
	vector<int> v;
	while(cin>>a){
		v.push_back(a);
	}
	if(v[0]>v[1]){
		cout<<v[0]<<' ';
	}
	for(int i=1;i<v.size();i++){
		if(v[i]>v[i-1]&&v[i]>v[i+1]&&i!=v.size()-1)
		cout<<v[i]<<' ';
	}
	if(v[v.size()-1]>v[v.size()-2]){
		cout<<v[v.size()-1];
	}
}