205392026-01-07 17:40:23mikloshunorKéséscpp17Accepted 50/50284ms9524 KiB
#include <iostream>
#include <vector>
#include <set>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector <int> v(n);
    set <int> t;
    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
        t.insert(v[i]);
    }
    int i = n - 1;
    while (!t.empty())
    {
        if (t.count(v[i]))
        {
            t.erase(v[i]);
        }
        i--;
    }
    cout << i+2;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms500 KiB
2Accepted0/014ms820 KiB
3Accepted5/52ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/564ms1076 KiB
6Accepted5/564ms1076 KiB
7Accepted4/4224ms6900 KiB
8Accepted4/4219ms6912 KiB
9Accepted4/4202ms5940 KiB
10Accepted4/4189ms5428 KiB
11Accepted4/4175ms4656 KiB
12Accepted2/2222ms5164 KiB
13Accepted2/2280ms9524 KiB
14Accepted1/1277ms9440 KiB
15Accepted1/1284ms9268 KiB
16Accepted1/1241ms7476 KiB
17Accepted1/1212ms5428 KiB
18Accepted1/1131ms1588 KiB
19Accepted1/1122ms1332 KiB