3827 2023. 03. 03 10:33:31 Dalma Völgy (100 pont) cpp17 Wrong answer 60/100 37ms 5408 KiB 
#include <iostream>

using namespace std;

int main()
{
    int hosszusag;
    cin >> hosszusag;
    int meterek[hosszusag];
    for (int i=0; i<hosszusag; i++)
    {
        cin >> meterek[i];
    }
    int volgy=0;
    int ujvolgy=0;
    int mero=0;
    for (int i=0; i<hosszusag; i++)
    {
        if (meterek[i]>=mero)
        {
            mero=meterek[i];
            ujvolgy=1;
        }
        else
        {
            ujvolgy++;
        }
        if (ujvolgy>volgy)
        {
            volgy=ujvolgy;
        }
    }
    cout << volgy << endl;
    return 0;
}
Subtask Sum Test Verdict Time Memory
base 60/100
1 Accepted 0/0 3ms 1748 KiB
2 Wrong answer 0/0 3ms 1988 KiB
3 Accepted 5/5 3ms 2204 KiB
4 Accepted 5/5 2ms 2420 KiB
5 Wrong answer 0/5 2ms 2656 KiB
6 Wrong answer 0/5 2ms 2640 KiB
7 Wrong answer 0/5 3ms 2780 KiB
8 Accepted 5/5 2ms 2992 KiB
9 Wrong answer 0/5 3ms 3192 KiB
10 Wrong answer 0/5 3ms 3396 KiB
11 Accepted 5/5 4ms 3628 KiB
12 Accepted 5/5 4ms 3856 KiB
13 Wrong answer 0/5 4ms 4200 KiB
14 Wrong answer 0/5 6ms 4284 KiB
15 Accepted 5/5 29ms 5088 KiB
16 Accepted 5/5 35ms 5012 KiB
17 Wrong answer 0/5 34ms 5016 KiB
18 Accepted 5/5 34ms 5164 KiB
19 Accepted 5/5 34ms 5248 KiB
20 Accepted 5/5 37ms 5224 KiB
21 Accepted 5/5 37ms 5376 KiB
22 Accepted 5/5 37ms 5408 KiB