150982025-02-12 19:42:30zhuyiRendező robot (80 pont)cpp17Wrong answer 2/8068ms1208 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long


int main()
{
    int n; cin >> n;
    vector <int> A(n+1);
    for(int i = 1; i <= n; i++) cin >> A[i];
    int cur = n, l = n;
    for(int i = n; i > 0; i--){
        if(A[i] == cur){
            cur--;
            l--;
        }
    }
    cout << max(0,2*l - 1);
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base2/80
1Accepted0/01ms316 KiB
2Wrong answer0/01ms500 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/31ms316 KiB
5Wrong answer0/31ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/22ms316 KiB
10Wrong answer0/21ms404 KiB
11Wrong answer0/21ms316 KiB
12Wrong answer0/21ms316 KiB
13Wrong answer0/21ms364 KiB
14Wrong answer0/21ms316 KiB
15Wrong answer0/21ms412 KiB
16Wrong answer0/21ms316 KiB
17Wrong answer0/22ms316 KiB
18Wrong answer0/468ms1192 KiB
19Wrong answer0/468ms1076 KiB
20Wrong answer0/468ms1080 KiB
21Wrong answer0/468ms1076 KiB
22Wrong answer0/468ms1076 KiB
23Wrong answer0/468ms1200 KiB
24Wrong answer0/468ms1192 KiB
25Wrong answer0/468ms1076 KiB
26Wrong answer0/468ms1076 KiB
27Wrong answer0/468ms1208 KiB
28Wrong answer0/468ms1076 KiB
29Wrong answer0/468ms1196 KiB