2532 2023. 01. 16 18:21:23 szabosamuel Völgy (100 pont) cpp11 Wrong answer 50/100 280ms 4980 KiB 
#include <iostream>
using namespace std;

int main()
{
    int n;
    cin >> n;
    int m[n+1];
    for(int i=1; i<=n; i++)
    {
        cin >> m[i];
    }
    int db=0, db2=0;
    int j;
    int x;
    for(int i=1; i<=n; i++)
    {
        j=i+1;
        while(m[i]>m[j] && j<=n)
        {
            db2++;
            if(j==n)
            {
                x=0;
                for(int k=i+1; k<j; k++)
                {
                    if(m[k]>=m[j])
                    {
                        x=1;
                    }
                }
                if(x==1) db2=0;
            }
            j++;
        }
        db2++;
        if(db2>db) db=db2;
        db2=0;
    }
    if(db==1) db-=2;
    cout << db;


    return 0;
}
Subtask Sum Test Verdict Time Memory
base 50/100
1 Accepted 0/0 3ms 1872 KiB
2 Wrong answer 0/0 2ms 2136 KiB
3 Accepted 5/5 2ms 2272 KiB
4 Accepted 5/5 2ms 2476 KiB
5 Wrong answer 0/5 2ms 2720 KiB
6 Wrong answer 0/5 2ms 2884 KiB
7 Accepted 5/5 2ms 3088 KiB
8 Accepted 5/5 2ms 3168 KiB
9 Wrong answer 0/5 3ms 3160 KiB
10 Wrong answer 0/5 2ms 3288 KiB
11 Accepted 5/5 4ms 3512 KiB
12 Accepted 5/5 4ms 3608 KiB
13 Accepted 5/5 4ms 3748 KiB
14 Wrong answer 0/5 6ms 3824 KiB
15 Accepted 5/5 32ms 4636 KiB
16 Accepted 5/5 37ms 4868 KiB
17 Time limit exceeded 0/5 280ms 3772 KiB
18 Accepted 5/5 35ms 4980 KiB
19 Time limit exceeded 0/5 247ms 3692 KiB
20 Time limit exceeded 0/5 264ms 3816 KiB
21 Time limit exceeded 0/5 268ms 3940 KiB
22 Time limit exceeded 0/5 230ms 3868 KiB