单调队列45分求救

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int N = 1e6 + 10 , M = 1e6 + 10;
int n , m , a[N] , q[N] , c[M] , cnt;
int main()
{
	cin >> n >> m;
	for (int i = 1 ; i <= n ; ++i) cin >> a[i];
	
	int hh = 0 , tt = -1;
	for (int i = 1 ; i <= n ; ++i)
	{
		c[a[i]]++;
		if(c[a[i]] == 1) cnt++;
		while(hh <= tt && a[q[hh]] == a[i])
		{
			c[a[q[hh]]] --;
			hh++;
		}
		q[++tt] = i;
		if(cnt == m)
		{
			cout << q[hh] << ' ' << q[tt] << endl;
			break;
		}
	}
	
	return 0;
}