147162025-01-29 11:32:02mateLegmesszebbi rossz sorrendű (35 pont)cpp17Wrong answer 0/3548ms1180 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
    vector <pair <int,int>> v(n);
    for(int i = 0; i < n; i++){
        int a;
        cin >> a;
        v[i] = {a,i};
    }
    int cnt = 0;
    sort(v.begin(),v.end());
    /*for(auto x : v){
        cout << x.second << ' ';
    }*/
    int maxi = v[0].second;
    int ans = 0;
    for(int i = 1; i < n; i++){
        maxi = max(maxi,v[i].second);
        ans = max(maxi - v[i].second, ans);
    }
    cout << ans;

}
SubtaskSumTestVerdictTimeMemory
base0/35
1Wrong answer0/01ms316 KiB
2Wrong answer0/048ms1076 KiB
3Wrong answer0/11ms316 KiB
4Wrong answer0/11ms316 KiB
5Wrong answer0/11ms316 KiB
6Wrong answer0/11ms316 KiB
7Wrong answer0/11ms316 KiB
8Wrong answer0/11ms316 KiB
9Wrong answer0/12ms328 KiB
10Wrong answer0/12ms316 KiB
11Wrong answer0/12ms316 KiB
12Wrong answer0/217ms564 KiB
13Wrong answer0/220ms760 KiB
14Wrong answer0/221ms564 KiB
15Wrong answer0/214ms564 KiB
16Wrong answer0/223ms564 KiB
17Wrong answer0/234ms820 KiB
18Wrong answer0/239ms820 KiB
19Wrong answer0/243ms1076 KiB
20Wrong answer0/243ms1080 KiB
21Wrong answer0/248ms1180 KiB
22Wrong answer0/248ms1076 KiB
23Wrong answer0/237ms1076 KiB
24Wrong answer0/237ms1076 KiB