163222025-04-28 17:25:14algoproKéséscpp17Accepted 50/50240ms8756 KiB
// UUID: 3d16a41b-95d6-4c2b-9f8d-c5672cd7d6c8
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    map<int, int> last;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        last[x] = i;
    }
    int ans = INT_MAX;
    for (pair<int, int> p : last) ans = min(ans, p.second);
    cout << ans;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/010ms576 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/567ms444 KiB
6Accepted5/568ms448 KiB
7Accepted4/4156ms6196 KiB
8Accepted4/4158ms6084 KiB
9Accepted4/4153ms5332 KiB
10Accepted4/4146ms4660 KiB
11Accepted4/4144ms4068 KiB
12Accepted2/2174ms4404 KiB
13Accepted2/2240ms8756 KiB
14Accepted1/1238ms8488 KiB
15Accepted1/1231ms8496 KiB
16Accepted1/1200ms6704 KiB
17Accepted1/1173ms4792 KiB
18Accepted1/1128ms964 KiB
19Accepted1/1123ms564 KiB