Submission #1475357

---

Source Code Expand

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int N;
    cin >> N;

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

    int idx = 0,
        ans = 0;
    while (idx < N) {
        ans++;

        int asc = idx + 1,  // 昇順
            des = idx + 1;  // 降順
        while (asc < N && A[asc - 1] <= A[asc]) {
            asc++;
        }
        while (des < N && A[des - 1] >= A[des]) {
            des++;
        }
        idx = max(asc, des);
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result