Submission

Score: 100

User: vachirasawin

Problemset: Maximum Adjacent

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-14 13:05:34

// grader-chan | SU
// c2_su65_maxadj.cpp | c2_su65_maxadj

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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    int n;
    vector<int> num;
    while (cin >> n) num.push_back(n);

    if (num.size() == 1) {
        cout << num[0] << " ";
        return 0;
    }
    for (int i = 0; i < num.size(); i++) {
        if (i == 0) {
            if (num[i] > num[i + 1]) cout << num[i] << " ";
        } 
        else if (i == num.size() - 1) {
            if (num[i] > num[i - 1]) cout << num[i] << " ";
        } 
        else {
            if (num[i] > num[i - 1] && num[i] > num[i + 1]) {
                cout << num[i] << " ";
            }
        }
    }
    

    return 0;
}