60pts求调

#include<bits/stdc++.h>
using namespace std;
#define int long long
int n, k, a[111111];
int mx = 0, tgt;
map<int, int> mp, m;
signed main(){
    cin >> n >> k;
    for (int i = 1; i <= n; i ++){
        cin >> a[i]; mp[a[i]] ++;
    }
    for (int i = 1; i <= n; i ++){
        if (mp[a[i]] > mx){
            mx = mp[a[i]]; tgt = a[i];
        }
    }
    int l = 1, r = 1, num = 0, cnt = 0, ans = 0; // num:删除的种类数 cnt:tgt的个数 ans:答案
    while (l <= n and r <= n){
        if (num <= k){
            if (a[r] == tgt) cnt ++;
            else{
                m[a[r]] ++; 
                if (m[a[r]] == 1) num ++;
            }
            r ++;
        }
        else{
            if (a[l] == tgt) cnt --;
            else{
                m[a[l]] --;
                if (m[a[l]] == 0) num --;
            }
            l ++;
        }
        ans = max(ans, cnt);
    }
    cout << ans;
    return 0;
}