Submission

PPPPPPPPPP

Score: 100

User: Nagornz

Problemset: Maximum Adjacent

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-14 13:01:37

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin();
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin();
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int32_t main(){
    iShowSpeed;
    vector <int> a;
    while (1) {
        string s; cin >> s;
        if (!(s[0] == '-' || (s[0] >= '0' && s[0] <= '9'))) break;
        int curr = 0;
        if (s[0] == '-') {
            for (int i = 1; i < s.length(); i++) curr = curr * 10 + (s[i] - '0');
            curr *= -1;
        }
        else for (int i = 0; i < s.length(); i++) curr = curr * 10 + (s[i] - '0');
        a.emb(curr);
    }
    int n = a.size();
    // for (auto e : a) cout << e << " ";
    for (int i = 0; i < n; i++) {
        if (i == 0) {
            if (a[i] > a[i + 1]) cout << a[i] << ' ';
        }
        else if (i == n - 1) {
            if (a[i] > a[i - 1]) cout << a[i] << " ";
        }
        else {
            if (a[i] > a[i - 1] && a[i] > a[i + 1]) cout << a[i] << " ";
        }
    }
}