235152026-01-24 10:21:17BoldizsárVölgy (100 pont)cpp17Wrong answer 10/10035ms808 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=volgy[0],l2=volgy[1];
    for(int i =0;i < n;i++){
        if (volgy[i] > volgy[l1]){
            l1 = i;l2 = -1;
        }else if(volgy[i] == volgy[l1]){
            l1=i;l2 = -1;
        }else if(volgy[i]> volgy[l2] || l2 == -1){
            l2 = i;
        }
        if(l2 != -1) ans = max(ans,abs(l1-l2));
    }
    cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base10/100
1Wrong answer0/01ms508 KiB
2Accepted0/01ms508 KiB
3Wrong answer0/51ms316 KiB
4Wrong answer0/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Wrong answer0/51ms336 KiB
8Runtime error0/51ms396 KiB
9Wrong answer0/51ms316 KiB
10Runtime error0/51ms544 KiB
11Runtime error0/53ms316 KiB
12Wrong answer0/53ms436 KiB
13Wrong answer0/53ms432 KiB
14Runtime error0/54ms316 KiB
15Wrong answer0/528ms564 KiB
16Wrong answer0/532ms800 KiB
17Wrong answer0/532ms564 KiB
18Wrong answer0/532ms564 KiB
19Wrong answer0/532ms564 KiB
20Runtime error0/535ms804 KiB
21Runtime error0/535ms804 KiB
22Runtime error0/535ms808 KiB