164462025-04-30 17:04:30algoproKéséscpp17Time limit exceeded 22/50601ms17716 KiB
// UUID: b75f9885-c093-424c-bd6e-06f314c76932
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> e(200000);
set<int> eo,er;
int seo;


int ser(int kezd){
    er = {};
    for(int i=kezd;i<n;i++){
        er.insert(e[i]);
    }
    return er.size();
}

int main() {
	cin>>n;
    for(int i=0;i<n;i++){
        cin>>e[i];
        eo.insert(e[i]);
    }
    seo = eo.size();

    int l=0;
    int r=n-1;
    int mid;
    while(l+1 != r){
        mid = (l+r)/2;
        if(ser(mid) == seo) l = mid;
        else r = mid;
    }
    cout<<r;
}
SubtaskSumTestVerdictTimeMemory
base22/50
1Accepted0/02ms1272 KiB
2Accepted0/050ms1968 KiB
3Accepted5/53ms1076 KiB
4Accepted5/53ms1076 KiB
5Accepted5/585ms1244 KiB
6Accepted5/582ms1244 KiB
7Time limit exceeded0/4601ms13048 KiB
8Time limit exceeded0/4588ms12596 KiB
9Time limit exceeded0/4582ms11060 KiB
10Time limit exceeded0/4583ms9780 KiB
11Time limit exceeded0/4583ms8500 KiB
12Time limit exceeded0/2587ms9264 KiB
13Time limit exceeded0/2587ms17716 KiB
14Time limit exceeded0/1588ms17716 KiB
15Time limit exceeded0/1587ms17452 KiB
16Time limit exceeded0/1588ms14156 KiB
17Time limit exceeded0/1577ms10012 KiB
18Accepted1/1317ms2100 KiB
19Accepted1/1206ms1588 KiB