2721 2023. 01. 19 13:39:12 Dalm Völgy (100 pont) cpp11 Wrong answer 75/100 246ms 5652 KiB 
#include <iostream>

using namespace std;

int main()
{
  int n;
  cin>>n;
  int magassag[n];
  for(int i=0;i<n;i++){
    cin>>magassag[i];
  }
  int k, v;
  int maxhossz=-1;
  int masodik=0; //második legnagyobb indexe
  for(k=0;k<=n-3; k++){
    v=k+1;
    masodik=k+1;
    while(magassag[v]<magassag[k]&&v!=n){
        if(magassag[v]>magassag[masodik])
            masodik=v;
        v++;
    }
    if(v==n){
        v=masodik;
    }
    if(v-k>maxhossz)
        maxhossz=v-k;
        k=v-1;
    }
    cout<<maxhossz;

return 0;
}
Subtask Sum Test Verdict Time Memory
base 75/100
1 Accepted 0/0 3ms 1876 KiB
2 Accepted 0/0 2ms 2080 KiB
3 Accepted 5/5 2ms 2292 KiB
4 Accepted 5/5 2ms 2396 KiB
5 Accepted 5/5 2ms 2588 KiB
6 Accepted 5/5 2ms 2796 KiB
7 Wrong answer 0/5 2ms 3000 KiB
8 Accepted 5/5 2ms 3204 KiB
9 Wrong answer 0/5 4ms 3448 KiB
10 Accepted 5/5 3ms 3652 KiB
11 Accepted 5/5 4ms 3760 KiB
12 Accepted 5/5 4ms 3720 KiB
13 Accepted 5/5 4ms 3728 KiB
14 Accepted 5/5 6ms 3860 KiB
15 Accepted 5/5 30ms 4672 KiB
16 Accepted 5/5 35ms 4924 KiB
17 Time limit exceeded 0/5 246ms 3992 KiB
18 Accepted 5/5 35ms 5416 KiB
19 Time limit exceeded 0/5 243ms 4356 KiB
20 Accepted 5/5 37ms 5652 KiB
21 Time limit exceeded 0/5 246ms 4432 KiB
22 Accepted 5/5 37ms 5612 KiB