163282025-04-28 17:33:11algoproKéséscpp17Accepted 50/50261ms9520 KiB
// UUID: 1c790129-7695-46ac-bddb-40d6108b812a
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N;
	cin >> N;
	vector<int> evszamok(N);
	set<int> utolso;
	for(int i=0;i<N;i++){
		cin >> evszamok[i];
		utolso.insert(evszamok[i]);
	}
	int minimum=N;
	while(!utolso.empty()){
		minimum--;
		utolso.erase(evszamok[minimum]);
	}
	cout << minimum+1;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/013ms824 KiB
3Accepted5/52ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/565ms1240 KiB
6Accepted5/564ms1080 KiB
7Accepted4/4206ms6964 KiB
8Accepted4/4196ms6772 KiB
9Accepted4/4187ms5944 KiB
10Accepted4/4172ms5424 KiB
11Accepted4/4162ms4660 KiB
12Accepted2/2208ms5172 KiB
13Accepted2/2261ms9520 KiB
14Accepted1/1245ms9308 KiB
15Accepted1/1256ms9176 KiB
16Accepted1/1221ms7476 KiB
17Accepted1/1202ms5428 KiB
18Accepted1/1128ms1588 KiB
19Accepted1/1119ms1332 KiB