Submission

Score: 100

User: navysrimuang

Problemset: Maximum Adjacent

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-17 19:16:06

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

int main(){
	cin.tie(0)->sync_with_stdio(0);
	vector<int> v;
	int n;
	while(cin >> n){
		v.push_back(n);
	}

	n = v.size();
	vector<int> ans;
	if(n >= 2 && v[0] > v[1]) ans.push_back(v[0]);
	for(int i = 1;i<n-1;i++){
		if(v[i] > v[i-1] && v[i] > v[i+1]) ans.push_back(v[i]);
	}
	if(n >= 2 && v[n-1] > v[n-2]) ans.push_back(v[n-1]);
	for(int x : ans) cout << x << " ";
	return 0;
}