Submission #1727885


Source Code Expand

#include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int n;
    int a[300002];
    int u;
    int x=0;
    int s=1;
    int num;
    int max = 0;
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> a[i];
    }
    if(n==1){
        max=1;
    }
    else if(n>=2){
    for(int i=1;i<n;i++){
        if(x==0){
            if(a[i]<a[i+1]){
                x=1;
            }
            else x=2;
        }
        if(a[i]>a[i+1] && x==1){
            x=2;
        }
        if(a[i]<a[i+1] && x==2){
            u=i;
            num = u-s+1;
            if(num > max){
                max = num;
            }
            s=i;
            x=1;
        }
        if(i+1 == n){
            u=i+1;
            num = u-s+1;
            //cout << s << u << endl;
            if(num > max){
                max = num;
            }
            
        }
    }
    }
    cout << max << endl;
    return 0;
}

Submission Info

Submission Time
Task B - 山のデータ
User mattar
Language C++14 (GCC 5.4.1)
Score 100
Code Size 984 Byte
Status AC
Exec Time 157 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 2 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 2 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 43 ms 512 KB
subtask2-03.txt AC 78 ms 896 KB
subtask2-04.txt AC 157 ms 1408 KB
subtask2-05.txt AC 154 ms 1408 KB
subtask2-06.txt AC 157 ms 1408 KB
subtask2-07.txt AC 155 ms 1408 KB
subtask2-08.txt AC 157 ms 1408 KB
subtask2-09.txt AC 154 ms 1408 KB
subtask2-10.txt AC 157 ms 1408 KB
subtask2-11.txt AC 155 ms 1408 KB
subtask2-12.txt AC 156 ms 1408 KB
subtask2-13.txt AC 155 ms 1408 KB
subtask2-14.txt AC 157 ms 1408 KB
subtask2-15.txt AC 157 ms 1408 KB