#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
vector< pair<int,int>>v;
signed main(){
    int n;
    cin>>n;
    vector<bool>vis(n+4);
    for(int i=1;i<=n;i++){
        int a;
        cin>>a;
        v.pb({a,i});
    }
    int ans=0;
    sort(v.begin(),v.end());
    int k=0;
    int h=0;
    while(v.size()){
        h=v.back().ff;
        while(v.size() and h==v.back().ff){
            if(vis[v.back().ss+1] and vis[v.back().ss-1]){
                k--;
            }
            if(!vis[v.back().ss+1] and !vis[v.back().ss-1]){
                k++;
            }
            vis[v.back().ss]=1;
            v.pop_back();
        }
        ans=max(ans,k);
    }
    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... |