Submission #3003297

---

Source Code Expand

#include <iostream>
using namespace std;
int N,H[300010];

int main(){
	cin >> N;
	int up = 1,down = 1; 
	for(int i=0;i<N;i++){
		cin >> H[i];
		if(i>=1){
			if(H[i]>H[i-1]){
				up++;
			}else up = -1e9;
			if(H[i]<H[i-1]){
				down++;
			}else down = -1e9;
		}
	}
	int ans = max(0,max(up,down));
	int l = 0,r = 1,muki = 1;
	while(r<N){
		if(H[r]>H[r-1] && muki == 1){
			r++;
		}else if(H[r]<H[r-1] && muki==1){
			r++;
			muki *= -1;
		}else if(H[r]<H[r-1] && muki==-1){
			r++;
		}else{
			ans = max(ans,r-l+1);
			l = r-1;
			muki *= -1;
		}
		if(r==N-1){
			ans = max(ans,r-l+1);
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result