MT3037 新月轩就餐

#include <bits/stdc++.h>using namespace std;#define ll long longconst int N = 1e6 + 10, M = 2005;const int INF = 0X3f3f3f3f;deque<int> q;int ans = INF;int n, m, cnt[M], a[N], l, r, type;int main(){    cin >> n >> m;    for (int i = 1; i <= n; i++)    {        cin >> a[i];        if (!cnt[a[i]])            type++; // 此区间内有多少种不同的数        cnt[a[i]]++;        q.push_back(i);        while (!q.empty() && cnt[a[q.front()]] > 1) // 如果此时队头元素的个数大于1，就pop掉        {            cnt[a[q.front()]]--;            q.pop_front();        }        if (type == m)        {            if (q.size() < ans) // 最小化付的钱            {                ans = q.size();                l = q.front();                r = q.back();            }        }    }    cout << l << " " << r << endl;    return 0;}