164542025-04-30 17:33:33algoproKéséscpp17Accepted 50/50215ms9524 KiB
// UUID: 318bdaa8-88fe-44b6-bf44-07a05f970b78
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	set<int>tn;
	int kii;
	vector<int>sz(n+1);
	for(int i=1; i<=n; i++){
		cin >> sz[i];
	}
	for(int i=n; i>0; i--){
		int a=sz[i];
		if(tn.count(a)==0){kii=i;
		tn.insert(a);
		}
		
	}
	cout << kii;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/010ms820 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/568ms1196 KiB
6Accepted5/568ms1196 KiB
7Accepted4/4163ms7080 KiB
8Accepted4/4164ms6824 KiB
9Accepted4/4153ms6056 KiB
10Accepted4/4149ms5428 KiB
11Accepted4/4142ms4660 KiB
12Accepted2/2171ms5172 KiB
13Accepted2/2209ms9524 KiB
14Accepted1/1208ms9384 KiB
15Accepted1/1215ms9268 KiB
16Accepted1/1200ms7732 KiB
17Accepted1/1171ms5428 KiB
18Accepted1/1128ms1460 KiB
19Accepted1/1123ms1332 KiB