126492024-12-27 14:57:43ffteklaInverziócpp17Wrong answer 3/501ms568 KiB
#include <iostream>
#include <climits>

using namespace std;

int N,S[100],i,j,poz,maxi,kezd,veg,tav,akt;
int main()
{
    maxi=INT_MIN;
    cin>>N;
    for (i=1;i<=N;++i)
        cin>>S[i];

    for (i=1;i<=N;++i)
    {
        akt=S[i];
        poz=i;
        for (j=N;j>=poz+1;--j)
        {
            if (akt>S[j])
            {
                tav=j-poz;
                break;
            }
        }
        if (tav>maxi)
        {
            maxi=tav;
            kezd=poz;
            veg=j;
        }
    }
    if (maxi>0) cout<<kezd<<" "<<veg;
    else cout<<"-1";

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base3/50
1Accepted0/01ms320 KiB
2Wrong answer0/01ms320 KiB
3Accepted1/11ms320 KiB
4Wrong answer0/21ms320 KiB
5Wrong answer0/71ms320 KiB
6Wrong answer0/21ms320 KiB
7Wrong answer0/21ms320 KiB
8Runtime error0/21ms320 KiB
9Runtime error0/21ms320 KiB
10Runtime error0/21ms320 KiB
11Runtime error0/21ms320 KiB
12Runtime error0/21ms508 KiB
13Runtime error0/21ms320 KiB
14Runtime error0/21ms568 KiB
15Wrong answer0/21ms320 KiB
16Runtime error0/21ms568 KiB
17Runtime error0/21ms500 KiB
18Runtime error0/21ms320 KiB
19Wrong answer0/31ms320 KiB
20Wrong answer0/31ms320 KiB
21Wrong answer0/21ms500 KiB
22Runtime error0/21ms320 KiB
23Runtime error0/21ms320 KiB
24Accepted2/21ms320 KiB