Submission #1220977

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key

typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

int a[100001];
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n; cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	int cnt=1;
	int mode=0;
	for(int i=0;i<n;i++)
	{
		if(i==0)
		{
			continue;
		}
		if(mode==0)
		{
			if(a[i]==a[i-1]) continue;
			if(a[i]>a[i-1]) mode=1;
			else mode=-1;
		}
		else if(mode==1)
		{
			if(a[i]<a[i-1])
			{
				cnt++;
				mode=0;
			}
		}
		else
		{
			if(a[i]>a[i-1])
			{
				cnt++;
				mode=0;
			}
		}
	}
	cout<<cnt<<'\n';
}

Submission Info

Judge Result