40分求助

#include <iostream>
#include <vector>
#include <map>
#define ll long long
using namespace std;
map<ll, ll> m;
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n, k;
		cin >> n;
		k = n;
		vector<ll> a(n + 1);
		for (int i = 1; i <= n; i++)
		{
			cin >> a[i];
		}
		for (int i = 1; i <= n; i++)
		{
			if (m[a[i]] == 1)
			{
				k = min(k, 2);
			}
			if (m[a[i]] && i == n)
			{
				k = min(k, 2);
			}
			if (m[a[i]])
			{
				k = min(k, 3);
			}
			m[a[i]] = i;
		}
		if (a[1] == a[n]) k = 1;
		cout << k << endl;
	}
	return 0;
}