Submission #3003285
Source Code Expand
#include <stdio.h> int main(void){ int n; int high[300005]; int s=0,t=0,u=0,max=0; scanf("%d",&n); for(int i=0; i<n; i++){ scanf("%d",&high[i]); } for(int i=0; i<n-1; i++){ s=i;t=i;u=i; while(s>0)if(high[s-1]<high[s])s--;else break; while(u<n-1)if(high[u]>high[u+1])u++;else break; if(s<=t && t<=u &&u-s+1>max)max=u-s+1; } printf("%d\n",max); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 山のデータ |
User | Autumn_A |
Language | C (GCC 5.4.1) |
Score | 0 |
Code Size | 453 Byte |
Status | WA |
Exec Time | 2103 ms |
Memory | 1280 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:7:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.c:9:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&high[i]); ^
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 70 | ||||||||||||
Status |
|
|
|
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 | 0 ms | 128 KB |
subtask0-sample-02.txt | AC | 0 ms | 128 KB |
subtask1-01.txt | WA | 0 ms | 128 KB |
subtask1-02.txt | AC | 0 ms | 128 KB |
subtask1-03.txt | AC | 1 ms | 128 KB |
subtask1-04.txt | WA | 0 ms | 128 KB |
subtask1-05.txt | AC | 1 ms | 128 KB |
subtask1-06.txt | AC | 1 ms | 128 KB |
subtask1-07.txt | AC | 1 ms | 128 KB |
subtask1-08.txt | AC | 0 ms | 128 KB |
subtask1-09.txt | AC | 1 ms | 128 KB |
subtask1-10.txt | AC | 0 ms | 128 KB |
subtask1-11.txt | AC | 1 ms | 128 KB |
subtask1-12.txt | AC | 1 ms | 128 KB |
subtask1-13.txt | AC | 0 ms | 128 KB |
subtask1-14.txt | AC | 0 ms | 128 KB |
subtask1-15.txt | AC | 1 ms | 128 KB |
subtask2-01.txt | AC | 2 ms | 256 KB |
subtask2-02.txt | AC | 11 ms | 512 KB |
subtask2-03.txt | TLE | 2103 ms | 768 KB |
subtask2-04.txt | TLE | 2103 ms | 1280 KB |
subtask2-05.txt | AC | 1609 ms | 1280 KB |
subtask2-06.txt | TLE | 2103 ms | 1280 KB |
subtask2-07.txt | AC | 40 ms | 1280 KB |
subtask2-08.txt | TLE | 2103 ms | 1280 KB |
subtask2-09.txt | AC | 1654 ms | 1280 KB |
subtask2-10.txt | AC | 232 ms | 1280 KB |
subtask2-11.txt | AC | 40 ms | 1280 KB |
subtask2-12.txt | TLE | 2103 ms | 1280 KB |
subtask2-13.txt | AC | 40 ms | 1280 KB |
subtask2-14.txt | AC | 1788 ms | 1280 KB |
subtask2-15.txt | AC | 40 ms | 1280 KB |