Submission #1496506

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;

signed main(){
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i, 0, n){
        cin >> a[i];
    }
    int ans = 1;
    int f = 0;
    rep(i, 1, n){
        if(a[i - 1] < a[i]){
            if(f == 0) f = 1;
            else if(f == -1){
                ans++;
                f = 0;
            }
        }
        if(a[i - 1] > a[i]){
            if(f == 0) f = -1;
            else if(f == 1){
                ans++;
                f = 0;
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result