Submission #1220982

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <cmath>
#include <climits>

#include <sstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
#include <functional>
#include <algorithm>

using namespace std;

#define fast_cin() ios_base::sync_with_stdio(false)

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

const int max_N = 1e5 + 10;
int A[max_N];

int main()
{
	fast_cin();

	int N;
	cin >> N;
	for (int i = 1; i <= N; ++i) {
		cin >> A[i];
	}

	int ans = 1, curr = 0;
	A[0] = A[1];
	for (int i = 1; i <= N; ++i) {
		if (A[i] > A[i - 1] && curr == -1) {
			curr = 0;
			++ans;
		} else if (A[i] < A[i - 1] && curr == 1) {
			curr = 0;
			++ans;
		} else if (A[i] > A[i - 1]) {
			curr = 1;
		} else if (A[i] < A[i - 1]) {
			curr = -1;
		}
	}

	cout << ans << endl;
}

Submission Info

Judge Result