Submission

[PPPP][P][P][P][P]

Score: 100

User: jeffyezez

Problemset: นก

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-27 17:56:48

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