Submission

Score: 70

User: C12

Problemset: Maximum Adjacent

Language: cpp

Time: 0.003 second

Submitted On: 2026-01-07 17:25:32

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

#define f first
#define s second
#define pii pair<ll,ll>
#define puii pair<ull,ull>
#define piii pair<ll,pii>
#define tiiii tuple<ll,ll,ll,ll>
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define mt make_tuple
 
#define mpiiii(a,b,c) make_pair(a,make_pair(b,c));
// ll mod = 1000000007;

void solve(){
    ll n = 0;
    string t;
    
    vector<ll>arr;

    while(1){
        cin >> t;
        if((t >= "A" && t <= "Z") || (t >= "a" && t <= "z")) break;
        arr.push_back(stoi(t));
        n++;
    }


    if(arr[0] > arr[1]) {
        cout << arr[0] << ' ';
    }
    for(int i = 0;i < n;i++){
        if(arr[i] > arr[i-1] && arr[i] >= arr[i+1]){
            cout << arr[i] << ' ';
        }
    }
    if(arr[n-1] > arr[n-2]) {
        cout << arr[n-1] << ' ';
    }


    return;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll q;
 
    // cin >> q;

    // while(q--)
        solve(); 

    return 0;
}
/*
10          
3
3
3
3
3
3
3
2
1
0
*/