Lista

#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
long n, o, ny, p = 1e8, l[101010];
unordered_map<long, int> mi, ma;
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> ny;
		l[i+1] = ny;
		o = max(o, ny);
		if (mi.find(ny) == mi.end()) {
			mi.insert({ny, i+1});
		}
		if (ma.find(ny) == ma.end()) {
			ma.insert({ny, i+1});
		} else {
			ma.at(ny) = max(ma.at(ny), i+1);
		}
	}
	for (long i = 1; i < o; i++) {
		if (ma.find(i) != ma.end() && mi.find(i) != mi.end()) {
		
			p = min(n - (ma.at(i) - mi.at(i) + 1), p);
			//cout << i << " " << miks[i] << " " << maks[i] << endl;
		}
	}
	cout << p << endl;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED