Submission #55969889

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    for (int &a: A) cin >> a;
    int contMax=1;
    int cont=1;
    for (int i=1; i<N; i++) {
        if (A.at(i-1)<=A.at(i)) {
            cont++;
        } else {
            if (contMax < cont) contMax=cont;
            cont=1;
        }
    }
    if (contMax<cont) contMax=cont;
    cout << contMax << endl;
}

Submission Info

Submission Time
Task C - 最長昇順連続部分列 (Longest Ascending Contiguous Subsequence)
User strkgr
Language C++ 20 (gcc 12.2)
Score 100
Code Size 443 Byte
Status AC
Exec Time 2 ms
Memory 3644 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 23
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 3508 KiB
01-02.txt AC 1 ms 3456 KiB
01-03.txt AC 1 ms 3608 KiB
01-04.txt AC 1 ms 3520 KiB
01-05.txt AC 1 ms 3420 KiB
01-06.txt AC 1 ms 3512 KiB
01-07.txt AC 1 ms 3424 KiB
01-08.txt AC 1 ms 3464 KiB
01-09.txt AC 2 ms 3444 KiB
01-10.txt AC 1 ms 3484 KiB
01-11.txt AC 1 ms 3496 KiB
01-12.txt AC 1 ms 3504 KiB
01-13.txt AC 1 ms 3448 KiB
01-14.txt AC 1 ms 3528 KiB
01-15.txt AC 1 ms 3564 KiB
01-16.txt AC 1 ms 3508 KiB
01-17.txt AC 1 ms 3640 KiB
01-18.txt AC 1 ms 3564 KiB
01-19.txt AC 1 ms 3448 KiB
01-20.txt AC 1 ms 3644 KiB
sample-01.txt AC 1 ms 3560 KiB
sample-02.txt AC 1 ms 3448 KiB
sample-03.txt AC 1 ms 3488 KiB