Submission

Score: 100

User: ChanakanStudy

Problemset: นก

Language: cpp

Time: 0.006 second

Submitted On: 2026-10-10 09:06:53

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> a(n);
    for (auto &x : a) cin >> x;
    ll count = 0;
    if(a.size() == 1) {
        cout << "1";
        return 0;
    }

    if(a[0] >= a[1]) {
        count++;
    }
    if(a[a.size()-1] > a[a.size()-2]) {
        count++;
    }

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