A241.花匠 AC题解

请看一下VIP代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int f[maxn][2], h[maxn], n;
int main () {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> h[i];
        f[i][0] = 1;
        f[i][1] = 1;
    }
    for (int i = 2; i <= n; i++) {
        for (int j = i - 1; j >= 1; j--) {
            if (h[i] > h[j]) f[i][1] = max(f[i][1], f[j][0] + 1);
            if (h[i] < h[j]) f[i][0] = max(f[i][0], f[j][1] + 1);
            if (f[i][0] > 1 && f[i][1] > 1) break;
        }
    }
    cout << max(f[n][0], f[n][1]);
    return 0;
}