Submission #1498967

---

Source Code Expand

#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

int main(){
	int n;
	cin >> n;
	vi a(n);
	rep(i, n) cin >> a[i];
	vi b;
	b.pb(a[0]);
	REP(i, 1, n) {
		if(b.back() != a[i]) b.pb(a[i]);
	}
	if(b.size() == 1) {
		cout << 1 << endl;
		return 0;
	}
	vi c;
	c.pb(b[0] < b[1]);
	int idx = 1;
	while(idx+1 < b.size()) {
		if((b[idx+1] > b[idx])^c.back()) {
			if(idx+2 >= b.size()) {
				c.pb(0);
				break;
			}
			c.pb(b[idx+2] > b[idx+1]);
			idx++;
		}
		idx++;
	}	
	cout << c.size() << endl;
	return 0;
}

Submission Info

Judge Result