겹치는건 싫어

www.acmicpc.net/problem/20922

20922번: 겹치는 건 싫어

#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<deque>
#include<math.h>
#include<cmath>
using namespace std;


int main() {
	
	int n, k;
	cin >> n;
	cin >> k;

	vector<int>v(n);

	for(int i = 0; i < n; i++) {
		cin >> v[i];
	}

	int s = 0;
	int e = 0;

	map<int,int>m;
	int maxlen = 0;

	m[v[s]]++;
	
	while (s <= e) {
	
		if (m[v[e]] > k) {
			if (maxlen < (e - s)) {
				maxlen = e - s;
			}
			m[v[s]]--;
			s++;
		}
		else {
			
		
			e++;
			if (e >= n) {
				if (maxlen < (e - s)) {
					maxlen = e - s;
				}
				break;
			}
			m[v[e]]++;
		
		
		}
	}

	cout << maxlen;


}