Submission #155939

---

Source Code Expand

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>

using namespace std;

#define dump(x)  cout << " "<< #x << " = " << (x) << endl;
#define pb push_back
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef complex<int> P;
typedef pair<int,int> pii;
const double EPS = 1e-10;
const double PI  = acos(-1.0);



bool solve(){
	int n;
	cin>> n;
	vector<int> a(n);
	for(int i=0;i<n;i++) cin>> a[i];
	
	int ans = 0;
	for(int i=1;i<n;i++){
		if(a[i-1] > a[i] || a[i] > a[i+1]){
			ans++;
			a[i] = a[i-1];
		}
	}
	
	cout<< ans<< endl;
	return true;
}

int main(){
	cout.setf(ios::fixed);
	cout.precision(10);
	
	solve();
	return 0;
}

 

Submission Info

Judge Result