164242025-04-29 17:54:49algoproKéséscpp17Accepted 50/50202ms18900 KiB
// UUID: b1b03845-6b38-4ef9-a3f9-24fa96b9095f
#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(evszamok.begin(),evszamok.end());
	int kulonbozo=osszes.size();
	unordered_map<int,int> db;
	int bal=n-1,talalat=0;
	while(bal>=0){
		if(++db[evszamok[bal]]==1)talalat++;
		if(talalat==kulonbozo)break;
		bal--;
	}
	cout << bal+1;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/09ms1076 KiB
3Accepted5/51ms508 KiB
4Accepted5/51ms316 KiB
5Accepted5/552ms1080 KiB
6Accepted5/554ms1196 KiB
7Accepted4/4130ms11808 KiB
8Accepted4/4126ms11552 KiB
9Accepted4/4123ms10528 KiB
10Accepted4/4116ms10016 KiB
11Accepted4/4108ms7316 KiB
12Accepted2/2142ms9888 KiB
13Accepted2/2202ms18900 KiB
14Accepted1/1194ms18780 KiB
15Accepted1/1199ms18784 KiB
16Accepted1/1164ms12456 KiB
17Accepted1/1142ms10012 KiB
18Accepted1/1104ms1964 KiB
19Accepted1/1101ms1332 KiB