Submission

Status:

[xSSS][P][P][P][P]

Subtask/Task Score:

{0/20}{20/20}{20/20}{20/20}{20/20}

Score: 80

User: matcher.pat

Problemset: นก

Language: cpp

Time: 0.002 second

Submitted On: 2025-11-29 21:21:37

#include<iostream>
#include<vector>
using namespace std;
int main(){
	int o,l,count=0;
	cin>>o;
	vector<int> v(o);
	v[0]=0;
	for(int i=1;i<v.size()+1;i++){
		cin>>v[i];
	}
	for(int i=1;i<v.size()+1;i++){
		if(v[i]>v[i+1]&&v[i]>v[i-1]){
			count=count+1;
		}
	}
	cout<<count;
}