1017 2022. 02. 24 19:26:22 Kevinke12 Völgy (100 pont) cpp14 Wrong answer 60/100 34ms 8036 KiB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long


int N, be1;
vector<int> a;

int main()
{
    cin >> N;
    for(int i = 0; i < N; i++)
    {
        cin >> be1;
        a.push_back(be1);
    }

    int ans=-1;
    //Megoldás
    for(int i = 0; i < N; i++)
    {
        int veg=i+1;
        while((veg<N) && (a[veg]<a[i])) //Fordítva futási 11
        {
            veg++;
        }
        ans = max(ans, veg-i);
        //cout << i << "-" << veg << "\n";

        i = veg-1;

    }
    cout << ans << "\n";
    return 0;
}
Subtask Sum Test Verdict Time Memory
base 60/100
1 Accepted 0/0 2ms 1816 KiB
2 Wrong answer 0/0 2ms 1864 KiB
3 Accepted 5/5 1ms 1912 KiB
4 Accepted 5/5 1ms 1916 KiB
5 Wrong answer 0/5 1ms 1920 KiB
6 Wrong answer 0/5 1ms 1920 KiB
7 Wrong answer 0/5 1ms 1928 KiB
8 Accepted 5/5 1ms 1932 KiB
9 Wrong answer 0/5 1ms 1944 KiB
10 Wrong answer 0/5 2ms 1968 KiB
11 Accepted 5/5 3ms 2008 KiB
12 Accepted 5/5 3ms 2104 KiB
13 Wrong answer 0/5 4ms 2200 KiB
14 Wrong answer 0/5 4ms 2300 KiB
15 Accepted 5/5 32ms 3748 KiB
16 Accepted 5/5 28ms 4268 KiB
17 Wrong answer 0/5 29ms 4836 KiB
18 Accepted 5/5 30ms 5408 KiB
19 Accepted 5/5 29ms 6064 KiB
20 Accepted 5/5 32ms 6716 KiB
21 Accepted 5/5 34ms 7412 KiB
22 Accepted 5/5 34ms 8036 KiB