164472025-04-30 17:07:25algoproKéséscpp17Accepted 50/50244ms19040 KiB
// UUID: e4aafe1c-0610-4ca3-9dff-a4cc131789fa
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin>> n;
	vector<int>evszamok(n);
	for(int i=0; i<n; i++){
		cin>> evszamok[i];
	}
	unordered_set<int> osszes_ev(evszamok.begin(), evszamok.end());
    int kulonbozo_evszamok_szama = osszes_ev.size();
    unordered_set<int> latott;
    int index = n - 1;
	for (int i = n - 1; i >= 0; --i) {
        latott.insert(evszamok[i]);
        if ((int)latott.size() == kulonbozo_evszamok_szama) {
            index = i;
            break;
        }
    }
	cout<< index+1<< "\n";
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/010ms1076 KiB
3Accepted5/51ms508 KiB
4Accepted5/51ms316 KiB
5Accepted5/554ms1196 KiB
6Accepted5/554ms1268 KiB
7Accepted4/4133ms11804 KiB
8Accepted4/4128ms11560 KiB
9Accepted4/4129ms10544 KiB
10Accepted4/4125ms10012 KiB
11Accepted4/4108ms7236 KiB
12Accepted2/2142ms9756 KiB
13Accepted2/2244ms19040 KiB
14Accepted1/1239ms18896 KiB
15Accepted1/1239ms18780 KiB
16Accepted1/1164ms12576 KiB
17Accepted1/1148ms10152 KiB
18Accepted1/1105ms1968 KiB
19Accepted1/1103ms1456 KiB