143172025-01-10 14:15:26buzaszendvicsKéséscpp11Accepted 50/5097ms2100 KiB
#include <iostream>
#include <stack>
#include <limits>

using namespace std;

bool gyak[1000000001];

int main()
{
    int n, be;
    stack <int> verem;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> be;
        verem.push(be);
    }

    int eleg;
    while(verem.size()) {
        if (!gyak[verem.top()]) {
            eleg = verem.size();
            gyak[verem.top()] = 1;
        }
        verem.pop();
    }
    cout << eleg;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/07ms316 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/550ms1184 KiB
6Accepted5/550ms1076 KiB
7Accepted4/471ms1392 KiB
8Accepted4/471ms1356 KiB
9Accepted4/471ms1400 KiB
10Accepted4/471ms1332 KiB
11Accepted4/471ms1184 KiB
12Accepted2/296ms1272 KiB
13Accepted2/297ms2080 KiB
14Accepted1/196ms2076 KiB
15Accepted1/197ms2072 KiB
16Accepted1/197ms2036 KiB
17Accepted1/196ms2100 KiB
18Accepted1/194ms1076 KiB
19Accepted1/194ms1080 KiB