237332026-01-28 15:47:12KristófVölgy (100 pont)cpp17Wrong answer 65/100300ms1284 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n;
    cin>>n;
    vector<int> a(n);
    for(int &x:a)cin>>x;
    int ans=-1;
    //cout<<"\n\n";
    for(int i=0;i<n-2;i++)
        {
        if(a[i]>a[i+1])
            {
            //cout<<a[i]<<"\n";
            int maxi=i+1;
            int j=i+2;
            while(j<n && a[j]<a[i])
                {
                if(a[maxi]<a[j])maxi=j;
                j++;
                }
            if(j==n)
                ans=max(ans,maxi-i);
            else ans=max(ans,j-i);
           i=maxi;
            }
        }
    cout<<ans;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base65/100
1Accepted0/01ms316 KiB
2Accepted0/01ms508 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms328 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms500 KiB
8Accepted5/51ms316 KiB
9Wrong answer0/52ms548 KiB
10Accepted5/51ms316 KiB
11Accepted5/53ms420 KiB
12Accepted5/53ms316 KiB
13Accepted5/54ms320 KiB
14Wrong answer0/54ms536 KiB
15Accepted5/528ms568 KiB
16Accepted5/532ms780 KiB
17Time limit exceeded0/5300ms564 KiB
18Accepted5/532ms1284 KiB
19Time limit exceeded0/5300ms1128 KiB
20Time limit exceeded0/5300ms572 KiB
21Time limit exceeded0/5300ms564 KiB
22Time limit exceeded0/5280ms564 KiB