Submission #3003765


Source Code Expand

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

int main(){
	cin >> N;
	int ans = 0;
	for(int i=0;i<N;i++){
		cin >> H[i];
	}
	for(int i=0;i<N;i++){
		int preans = 1;
		if(i==0){
			int j = 0;
//			preans++;
			while(H[j]>H[j+1] && j<N-1){
				preans++;
				j++;
			}
		}
		else if(i==N-1){
			int j = N-1;
//			preans++;
			while(H[j-1]<H[j] && j>0){
				preans++;
				j--;
			}	
		}else if(H[i]>H[i-1] && H[i]>H[i+1]){
			int j = i;
			while(H[j]>H[j+1] && j<N-1){
				preans++;
				j++;
			}
			j = i;
			while(H[j-1]<H[j] && j>0){
				preans++;
				j--;
			}
		}
		ans = max(ans,preans);
	}
	cout << ans << endl;
}

Submission Info

Submission Time
Task B - 山のデータ
User idsigma
Language C++14 (GCC 5.4.1)
Score 100
Code Size 671 Byte
Status AC
Exec Time 159 ms
Memory 1408 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 2
AC × 17
AC × 32
Set Name Test Cases
Sample subtask0-sample-01.txt, subtask0-sample-02.txt
Subtask1 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt
Subtask2 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt
Case Name Status Exec Time Memory
subtask0-sample-01.txt AC 1 ms 256 KB
subtask0-sample-02.txt AC 1 ms 256 KB
subtask1-01.txt AC 1 ms 256 KB
subtask1-02.txt AC 1 ms 256 KB
subtask1-03.txt AC 1 ms 256 KB
subtask1-04.txt AC 1 ms 256 KB
subtask1-05.txt AC 1 ms 256 KB
subtask1-06.txt AC 1 ms 256 KB
subtask1-07.txt AC 1 ms 256 KB
subtask1-08.txt AC 1 ms 256 KB
subtask1-09.txt AC 1 ms 256 KB
subtask1-10.txt AC 1 ms 256 KB
subtask1-11.txt AC 1 ms 256 KB
subtask1-12.txt AC 1 ms 256 KB
subtask1-13.txt AC 1 ms 256 KB
subtask1-14.txt AC 1 ms 256 KB
subtask1-15.txt AC 1 ms 256 KB
subtask2-01.txt AC 9 ms 256 KB
subtask2-02.txt AC 42 ms 512 KB
subtask2-03.txt AC 79 ms 768 KB
subtask2-04.txt AC 154 ms 1408 KB
subtask2-05.txt AC 156 ms 1408 KB
subtask2-06.txt AC 154 ms 1408 KB
subtask2-07.txt AC 157 ms 1408 KB
subtask2-08.txt AC 154 ms 1408 KB
subtask2-09.txt AC 156 ms 1408 KB
subtask2-10.txt AC 154 ms 1408 KB
subtask2-11.txt AC 157 ms 1408 KB
subtask2-12.txt AC 154 ms 1408 KB
subtask2-13.txt AC 159 ms 1408 KB
subtask2-14.txt AC 150 ms 1408 KB
subtask2-15.txt AC 157 ms 1408 KB