Submission #3007340


Source Code Expand

#include <stdio.h>

int main(void){
    int n;
    int hi[300005];
    scanf("%d",&n);
    for(int i=0; i<n; i++){
        scanf("%d",&hi[i]);
    }
    int ans=0,max=0;
    for(int i=0; i<n; i++){
        ans=1;
        if(i==0){
            int j=0;
            while(hi[j]>hi[j+1] && j<n-1){
                ans++;
                j++;
            }
        }
        else if(i==n-1){
            int j=n-1;
            while(hi[j-1]<hi[j] && 0<j){
                ans++;
                j--;
            }
        }
        else if(hi[i-1]<hi[i] && hi[i]>hi[i+1]){
            int j=i,k=i;
            while(hi[j-1]<hi[j] && 0<j){
                ans++;
                j--;
            }
            while(hi[k]>hi[k+1] && k<n-1){
                ans++;
                k++;
            }
        }
        if(max<ans)max=ans;
    }
    printf("%d\n",max);
    return 0;
}

Submission Info

Submission Time
Task B - 山のデータ
User Autumn_A
Language C (GCC 5.4.1)
Score 100
Code Size 918 Byte
Status AC
Exec Time 39 ms
Memory 1280 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:6:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ^
./Main.c:8:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&hi[i]);
         ^

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 128 KB
subtask0-sample-02.txt AC 1 ms 128 KB
subtask1-01.txt AC 1 ms 128 KB
subtask1-02.txt AC 1 ms 128 KB
subtask1-03.txt AC 1 ms 128 KB
subtask1-04.txt AC 1 ms 128 KB
subtask1-05.txt AC 1 ms 128 KB
subtask1-06.txt AC 0 ms 128 KB
subtask1-07.txt AC 1 ms 128 KB
subtask1-08.txt AC 1 ms 128 KB
subtask1-09.txt AC 1 ms 128 KB
subtask1-10.txt AC 1 ms 128 KB
subtask1-11.txt AC 1 ms 128 KB
subtask1-12.txt AC 1 ms 128 KB
subtask1-13.txt AC 1 ms 128 KB
subtask1-14.txt AC 1 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 AC 20 ms 768 KB
subtask2-04.txt AC 38 ms 1280 KB
subtask2-05.txt AC 38 ms 1280 KB
subtask2-06.txt AC 38 ms 1280 KB
subtask2-07.txt AC 39 ms 1280 KB
subtask2-08.txt AC 38 ms 1280 KB
subtask2-09.txt AC 38 ms 1280 KB
subtask2-10.txt AC 38 ms 1280 KB
subtask2-11.txt AC 39 ms 1280 KB
subtask2-12.txt AC 38 ms 1280 KB
subtask2-13.txt AC 39 ms 1280 KB
subtask2-14.txt AC 38 ms 1280 KB
subtask2-15.txt AC 39 ms 1280 KB