235202026-01-24 10:42:56BoldizsárVölgy (100 pont)cpp17Wrong answer 90/10039ms832 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;cin >> n;
    int ans =0;
    vector<int>volgy(n);
    for(int i = 0;i < n;i++){cin >> volgy[i];}
    int l1=0,l2=-1;
    for(int i =1;i < n;i++){
        if (volgy[i] >= volgy[l1]){
            l2 = l1;l1 = i;
            ans = max(ans,abs(l1-l2));
            l2 = -1;
        }else if(volgy[i]> volgy[l2] || l2 == -1){
            l2 = i;
        }
        if(l2 != -1) ans = max(ans,abs(l1-l2));
    }
    if(ans < 3) cout << -1;
    else cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base90/100
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Wrong answer0/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms588 KiB
7Accepted5/51ms316 KiB
8Accepted5/51ms560 KiB
9Accepted5/51ms316 KiB
10Accepted5/51ms316 KiB
11Accepted5/53ms316 KiB
12Accepted5/53ms316 KiB
13Accepted5/54ms316 KiB
14Wrong answer0/54ms316 KiB
15Accepted5/530ms832 KiB
16Accepted5/535ms816 KiB
17Accepted5/535ms564 KiB
18Accepted5/534ms564 KiB
19Accepted5/535ms564 KiB
20Accepted5/537ms564 KiB
21Accepted5/537ms800 KiB
22Accepted5/539ms800 KiB