Submission

[PPP-][P][P][P][P]

Score: 80

User: Augus30

Problemset: นก

Language: cpp

Time: 0.002 second

Submitted On: 2025-04-01 17:56:16

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

int main() {
    int n; cin >> n;
    vector<int> tree;
    for(int i=0;i<n;i++){
        int a; cin >> a;
        tree.push_back(a);
    }
    int net=0;
    if(tree[0]>tree[1]) net++;
    if(tree[n-2]<tree[n-1]) net++;
    for(int i=1;i<n-1;i++){
        if(tree[i]>tree[i-1] && tree[i]>tree[i+1]){
            net++;
        }
    }
    cout << net;
}