0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-25 18:32:00 +00:00
OI-codes/AcWing/1014/1014.cpp

30 lines
630 B
C++

#include <bits/stdc++.h>
using namespace std;
int n, h[1005], f[1005], g[1005], ans;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
for (int i = 1; i <= n; i++) {
f[i] = 1;
for (int j = 1; j <= i; j++) {
if (h[i] > h[j]) f[i] = max(f[i], f[j] + 1);
}
}
for (int i = n; i >= 1; i--) {
g[i] = 1;
for (int j = n; j >= i; j--) {
if (h[i] > h[j]) g[i] = max(g[i], g[j] + 1);
}
}
for (int i = 1; i <= n; i++) {
ans = max(ans, f[i] + g[i] - 1);
}
cout << ans << endl;
return 0;
}