Submission

Score: 100

User: Design

Problemset: นก

Language: cpp

Time: 0.004 second

Submitted On: 2026-09-21 18:08:17

#include<iostream>
#include<cmath>
#include<algorithm>
#include<iomanip>
using namespace std;
int main()
{ 
	int N;
	cin>>N;
	int box[N];
	int count=0;
	for (int i=0;i<N;i++){
		cin>>box[i];
	}
	for (int i=0;i<N;i++){
		if (i==0){
			if (box[0]>box[1]){
				count=count+1;
				//cout<<box[i]<<"   ";
			}
		}
		else if (i==N-1){
			if (box[N-1]>box[N-2]){
				count=count+1;
				//cout<<box[i]<<"   ";
			}
		}
		else {
			if (box[i]>box[i+1]&&box[i]>box[i-1]){
				count=count+1;
				//cout<<box[i]<<"   ";
			}
		}
	}
	cout<<count;
	return 0;
}