20922번

20922

#include <iostream>
#include <vector>
using namespace std;

int n,k;
vector<int> v;
int main() {
    cin>>n>>k;

    vector<int> visited(100001,0);

    for(int i=0;i<n;i++) {
        int num;
        cin>>num;
        v.push_back(num);
    }

    int end = 0;
    int answer = 0;

    for(int start=0; start<n; start++) {
        while(visited[v[end]] < k && end < n) {
            visited[v[end]]++;
            end++;
        }
        answer = max(answer, end-start);
        visited[v[start]]--;
        if(end == n) break;
    }
    cout<<answer;

}