Submission #3003314

---

Source Code Expand

#include <iostream>
#include <algorithm>

using namespace std;
long long a[300010],b[300010];
int main(){
	int n,h[300010];
	cin >> n;
	for(int i=0;i<n;i++){
		cin >> h[i];
	}
	int l = 0, r = 1;
	a[0] = 0;
	int mx = h[l];
	while(r<n){
		if(max(mx,h[l])<h[r]){
			a[r] = l;
			mx = max(mx,h[r]);
			r++;
		}else{
			a[r] = r;
			l = r;
			r = l+1;
			mx = 0;
		}
	}
	l = n-2; r = n-1;
	b[n-1] = n-1;
	mx = h[r];
	while(l>=0){
		if(h[l]>max(mx,h[r])){
			b[l] = r;
			mx = max(mx,h[l]);
			l--;
		}else{
			b[l] = l;
			r = l;
			l = r-1;
			mx = 0;
		}
	}
	long long ans=0;
	int i;
	for(i=0;i<n;i++){
		//cout << a[i] << " ";
	}
	//cout << endl;
	for(i=0;i<n;i++){
		//cout << b[i] << " ";
	}
	//cout << endl;
	for(int i=0;i<n;i++){
		ans = max(b[i]-a[i]+1,ans);
	}
	cout << ans << endl;
}
		
		

Submission Info

Judge Result