baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-27 15:16:28 +00:00
Code Releases Activity

1014. 登山

Browse Source 
https://www.acwing.com/problem/content/submission/code_detail/8792171/
This commit is contained in:
Baoshuo Ren 2021-11-12 22:08:50 +08:00 committed by Baoshuo Ren
parent 2611a0d1e0
commit c35d417c81
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 29 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
AcWing/1014/1014.cpp Normal file
View File

@ -0,0 +1,29 @@
#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;
}