Submission #3003597


Source Code Expand

#include <stdio.h>

int main(void){
    int n;
    int high[300005];
    int max=0;
    scanf("%d",&n);
    for(int i=0; i<n; i++){
        scanf("%d",&high[i]);
    }
    int l=0,r=0,temp;
    for(int i=1; i<n; i++){
        if(high[i-1]<high[i]){
            l++;
            temp=r;
            r=0;
        }
        else {
            r++;
            temp=l;
            l=0;
        }
        if(max<temp+l+r+1)max=temp+l+r+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 507 Byte
Status WA
Exec Time 41 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
AC × 2
AC × 7
WA × 10
AC × 10
WA × 22
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 128 KB
subtask0-sample-02.txt AC 1 ms 128 KB
subtask1-01.txt WA 0 ms 128 KB
subtask1-02.txt WA 1 ms 128 KB
subtask1-03.txt WA 1 ms 128 KB
subtask1-04.txt AC 1 ms 128 KB
subtask1-05.txt AC 1 ms 128 KB
subtask1-06.txt WA 1 ms 128 KB
subtask1-07.txt WA 1 ms 128 KB
subtask1-08.txt WA 1 ms 128 KB
subtask1-09.txt WA 1 ms 128 KB
subtask1-10.txt WA 0 ms 128 KB
subtask1-11.txt AC 1 ms 128 KB
subtask1-12.txt AC 1 ms 128 KB
subtask1-13.txt WA 1 ms 128 KB
subtask1-14.txt AC 1 ms 128 KB
subtask1-15.txt WA 1 ms 128 KB
subtask2-01.txt WA 2 ms 256 KB
subtask2-02.txt WA 11 ms 512 KB
subtask2-03.txt AC 19 ms 768 KB
subtask2-04.txt WA 37 ms 1280 KB
subtask2-05.txt WA 38 ms 1280 KB
subtask2-06.txt AC 38 ms 1280 KB
subtask2-07.txt WA 39 ms 1280 KB
subtask2-08.txt AC 37 ms 1280 KB
subtask2-09.txt WA 37 ms 1280 KB
subtask2-10.txt WA 37 ms 1280 KB
subtask2-11.txt WA 39 ms 1280 KB
subtask2-12.txt WA 37 ms 1280 KB
subtask2-13.txt WA 41 ms 1280 KB
subtask2-14.txt WA 37 ms 1280 KB
subtask2-15.txt WA 39 ms 1280 KB