【第49题】[NOIP2013 提高组] 花匠

#include <bits/stdc++.h>
using namespace std;

void coder() {
//    freopen("flower.in", "r", stdin);
//    freopen("flower.out", "w", stdout);
    int n;
    scanf("%d", &n);
    vector<int> a(n + 5);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &a[i]);
    }
    bool b = false;
    if (a[1] >= a[0]) {
        b ^= 1;
    }
    int solve = 1;
    if (n == 1) {
        printf("%d", 1);
        return;
    }
    for (int i = 0; i < n; ++i) {
        if (!b && i == n - 1) {
            ++solve;
            break;
        }
        if (b) {
            if (a[i + 1] < a[i]) {
                ++solve;
                b ^= 1;
                continue;
            }
        }
        if (!b) {
            if (a[i + 1] > a[i]) {
                ++solve;
                b ^= 1;
                continue;
            }
        }
    }
    printf("%d", solve);
//    fclose(stdin);
//    fclose(stdout);
}

void best() {

}

int main() {
    //best();
    coder();
    return 0;
}