#include<bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define pb push_back
using namespace std;
int n, h[1000005];
vector <pair <int, int> > v;
int main(){
map <int, int> mp;
cin>>n;
for(int i=1; i<=n; i++){
cin>>h[i];
v.pb({h[i], i});
}
sort(v.begin(), v.end());
int cnt=0, ans=0;
for(int i=n-1; i>=0; i--){
int idx=v[i].ss;
if(mp[idx+1]+mp[idx-1]==0){
cnt++;
}
if(mp[idx+1]+mp[idx-1]==2){
cnt--;
}
mp[idx]=1;
ans=max(cnt, ans);
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |