洛谷P1970 花匠(dp)

#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN = 1e6 + 10;
inline int read() {
    char c = getchar(); int x = 0, f = 1;
    while(c < '0' || c > '9') {if(c == '-') f = -1; c = getchar();}
    while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}
int N, a[MAXN], f[MAXN][2];
int main() {
    N = read();
    for(int i = 1; i <= N; i++) {
        a[i] = read();
        if(i == 1) f[i][0] = f[i][1] = 1;
        else {
            f[i][0] = f[i - 1][0];
            f[i][1] = f[i - 1][1];
            if(a[i] > a[i - 1]) f[i][1] = max(f[i][1], f[i - 1][0] + 1);
            if(a[i] < a[i - 1]) f[i][0] = max(f[i][0], f[i - 1][1] + 1);
        }
    }
    printf("%d", max(f[N][1], f[N][0]));
    return 0;
}
/*
4 
2 3 4 5
*/