Submission #1794283

---

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;
	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;
		}
	}
	if (a[n - 1] >= a[n]) a[n + 1] = a[n] - 1;
	else a[n + 1] = a[n] + 1;       	
	for (int i = 1;i <= n + 1;i ++) {
		if (a[i] <= a[i + 1]) d[i] = 1;
		else d[i] = 0;
	}
	int ans = 0;
	for (int i = 2;i <= n + 1;i ++) {
	    if (d[i] != d[i - 1])
			ans ++, i ++;
	}
	cout << ans;
	return 0;
}

Submission Info

Judge Result