Submission #1794813

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int a[100001];
int d1[100001];
int d[100001];

 main () {
	ios_base::sync_with_stdio (0);
	cin.tie (0);
	int n, n1;
	cin >> n1;
	if (n1 == 1) {
		cout << 1;
		return 0;
	}
	int kol = 0, kol1 = 0;
	int ok = 1;
	for (int i = 1;i <= n1;i ++) {
		int x;
		cin >> x;
		if (a[n] != x) {
			n ++;
			a[n] = x;
		}
	}
	for (int i = 1;i <= n;i ++) {
		if (n == i) {   
			d[i] = d[i - 1];
			continue;
		}
		if (a[i] < a[i + 1]) {
			d[i] = 1;
		}
		else d[i] = -1;
	}
	for (int i = 1;i <= n;i ++) {
		if (d[i] != d[i - 1] && d[i - 1] != 2) {
			kol ++;
		//	cout << i << ' ';
			if (i != 1) 
				d[i] = 2;
		}
	}
	cout << kol;
	return 0;                     
}

Submission Info

Judge Result