Submission

Score: 100

User: Kittiponn

Problemset: Maximum Adjacent

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-04 09:03:48

#include <bits/stdc++.h>
#define ll long long
#define sp << ' ' <<
#define nl << '\n' 
#define cnl cout << '\n'
using namespace std;
const int nx = 1e5+5;
const int INF = 1e9+5;
const int MOD = 1e9+7;

vector<int> mp,ip;

int main(){
    cin.tie(0)->sync_with_stdio(0);
    while(1){
        string n;
        cin >> n;
        if((n >= "a" && n <= "z")||(n >= "A" && n <= "Z")) break;
        int k = stoi(n);
        ip.push_back(k);
    }
    ip.push_back(0);
    for(int i = 0;i < ip.size();i++){
        if(i == 0&& ip[i] > ip[i+1])mp.push_back(ip[i]);
        else if(ip[i] > ip[i+1] && ip[i] > ip[i-1])mp.push_back(ip[i]);
    }
    for(auto x : mp) cout << x << ' ';
}