Submission

Score: 100

User: korn234

Problemset: นก

Language: cpp

Time: 0.004 second

Submitted On: 2026-09-20 09:03:50

#include <iostream>
using namespace std;
int main(){
	int n;
	int tree[1000];
	int count=0;
	cin>>n;
	for (int i=0; i<n; i++){
		cin>>tree[i];
	}
	if (n==1){
		count++;
		cout<<count;
		return 0;
	}
	if (tree[0]>tree[1]){
		count++;
	}
	for (int i=1; i<n-1; i++){
		if (tree[i]>tree[i-1] && tree[i]>tree[i+1]){
			count++;
		}
	}
	if (tree[n-1]>tree[n-2]){
		count++;
	}
	cout<<count;
}