164512025-04-30 17:19:04algoproKéséscpp17Accepted 50/50174ms9524 KiB
// UUID: c3cdb41a-e3f9-45f2-806f-453d15b4b906
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    set<int> evszam;
    vector<int> idok(n+1);
    for (int i = 0; i < n; i++) {
        cin >> idok[i];
    }
    int elozomeret=0, utolsoido;
    for (int i = n-1; i >= 0; i--) {
        evszam.insert(idok[i]);
        if (evszam.size() > elozomeret) {
            elozomeret = evszam.size();
            utolsoido = i + 1;
        }
    }
	cout << utolsoido <<"\n";
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/09ms820 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/561ms1076 KiB
6Accepted5/561ms1192 KiB
7Accepted4/4129ms7084 KiB
8Accepted4/4130ms6828 KiB
9Accepted4/4127ms5940 KiB
10Accepted4/4122ms5552 KiB
11Accepted4/4118ms4660 KiB
12Accepted2/2142ms5036 KiB
13Accepted2/2174ms9524 KiB
14Accepted1/1170ms9388 KiB
15Accepted1/1172ms9268 KiB
16Accepted1/1159ms7604 KiB
17Accepted1/1146ms5492 KiB
18Accepted1/1115ms1452 KiB
19Accepted1/1111ms1336 KiB