163292025-04-28 17:33:55algoproKéséscpp17Accepted 50/50367ms9524 KiB
// UUID: 62b70bb0-77ca-4be4-aff4-e345d83635fb
#include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <vector>
using namespace std;

int main() {
	int n, ans; cin >> n;
    vector<int> szamok(n, 0);
    map<int, int> vis;
    for (int i=0;i<n;i++){
        cin >> szamok[i];
        vis[szamok[i]] = 0;
    }
    reverse(szamok.begin(), szamok.end());
    for (int i=0;i<n;i++) {
        if (!vis[szamok[i]]) {
            ans = i+1;
            vis[szamok[i]] = 1;
            // cout << ans << 'a' << endl;
        }
    }   
    cout << n-ans+1 << '\n';
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/014ms848 KiB
3Accepted5/52ms316 KiB
4Accepted5/51ms328 KiB
5Accepted5/583ms1076 KiB
6Accepted5/583ms1076 KiB
7Accepted4/4238ms7100 KiB
8Accepted4/4236ms6708 KiB
9Accepted4/4224ms6036 KiB
10Accepted4/4238ms5512 KiB
11Accepted4/4202ms4656 KiB
12Accepted2/2256ms5104 KiB
13Accepted2/2300ms9524 KiB
14Accepted1/1294ms9272 KiB
15Accepted1/1367ms9224 KiB
16Accepted1/1328ms7476 KiB
17Accepted1/1231ms5568 KiB
18Accepted1/1156ms1588 KiB
19Accepted1/1144ms1332 KiB