Submission #1220993

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define F first
#define S second

#define fo(i, n) for(int i = 1; i <= n; ++i)
#define rep(i, a, b) for(int (i) = (a); (i) < (b); ++(i))

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 200200;
const int mod = 1e9 + 7;
const ll INF = 1e18;

int n, a[N];
int ans;

int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> n;
	fo(i, n)
		cin >> a[i];
	for(int i = 1; i <= n;)
	{
		while(i + 1 <= n && a[i + 1] == a[i]) ++i;
		if(a[i + 1] > a[i])
			while(i + 1 <= n && a[i + 1] >= a[i]) ++i;
		else                                           	
			while(i + 1 <= n && a[i + 1] <= a[i]) ++i;
		++i;
		ans++;
	}
	cout << ans;
	
	return 0;	
}

Submission Info

Judge Result