163232025-04-28 17:25:46algoproKéséscpp17Accepted 50/50127ms9672 KiB
// UUID: a4f94051-e220-4f12-83ae-dd7292593567
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int maxn = INT_MAX;

template <typename T> void printVector(T vec){
	for(const auto& i : vec)
		cerr << i << ' ';
	cerr << '\n';
}
template <typename T> void printVector2D(T vec){
	for(const auto& i : vec){
		for(const auto& j : i){
			cerr << j << ' ';
		}
		cerr << '\n';
	}
}

void solve() {

	int n;
	cin >> n;

	vector<int> be(n);
	for(auto& i : be) cin >> i;

	set<int> s; s.insert(be.back());
	int prev = 1, curr = 1;
	int index = n;

	for(int i = n-2; i >= 0; i--){
		s.insert(be[i]);
		curr = s.size();
		if(curr > prev){
			index = i + 1;
		}
		prev = curr;
	}

	cout << index;

}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
    cout.tie(nullptr);
 
	int t = 1; //cin >> t;
	while(t--) solve();
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/06ms820 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/532ms1260 KiB
6Accepted5/530ms1216 KiB
7Accepted4/492ms7108 KiB
8Accepted4/492ms6844 KiB
9Accepted4/482ms5940 KiB
10Accepted4/478ms5420 KiB
11Accepted4/474ms4660 KiB
12Accepted2/279ms5172 KiB
13Accepted2/2119ms9672 KiB
14Accepted1/1119ms9416 KiB
15Accepted1/1127ms9268 KiB
16Accepted1/1104ms7732 KiB
17Accepted1/182ms5428 KiB
18Accepted1/150ms1588 KiB
19Accepted1/146ms1324 KiB