164552025-04-30 17:37:54algoproKéséscpp17Accepted 50/50212ms9524 KiB
// UUID: 717b67d6-5ac9-4619-9029-431b464cfc92
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	int a;
	int hol = 0;
	set<int>evszam;
	vector<int>e(n);
	for(int i= 0; i < n; i++){
		cin >> e[i];
		
	}
	for(int i= n-1; i >=0; i--){
		if(evszam.find(e[i])==evszam.end() ){
			evszam.insert(e[i]);
			hol=i;
		}

	}
	cout << hol+1;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms500 KiB
2Accepted0/010ms740 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/563ms1236 KiB
6Accepted5/564ms1076 KiB
7Accepted4/4159ms7088 KiB
8Accepted4/4159ms6824 KiB
9Accepted4/4149ms5940 KiB
10Accepted4/4143ms5428 KiB
11Accepted4/4137ms4780 KiB
12Accepted2/2163ms5040 KiB
13Accepted2/2211ms9524 KiB
14Accepted1/1212ms9268 KiB
15Accepted1/1209ms9268 KiB
16Accepted1/1194ms7600 KiB
17Accepted1/1189ms5428 KiB
18Accepted1/1122ms1588 KiB
19Accepted1/1115ms1272 KiB