浙工大15新生赛 串

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
struct Hui {
	char Yi[11];
	int flag;
}Num[100000];
int main() {
	char Lu[100000];
	int n, k;
	while (scanf("%d%d", &n, &k) != EOF) {
		for (int i = 0; i < n; i++)
			cin >> Lu[i];
		for (int i = 0; i <= n - k; i++) {
			for (int j = 0; j < k; j++) {
				Num[i].Yi[j] = Lu[i + j];
			}
			Num[i].flag = 1;
		}
		int Max = 0, m;
		for (int i = 0; i <= n - k; i++) {
			int w;
			m = 0;
			for (int j = 0; j <= n - k; j++) {
				w = 0;
				if (!Num[i].flag)
					break;
				for (int q = 0; q < k; q++) {
					if (Num[i].Yi[q] == Num[j].Yi[q])
						w++;
				}
				if (w == k) {
					m++;
					if(j > 0)
						Num[j].flag = 0;
				}
			}
			Num[i].flag = 0;
			Max = max(m, Max);
		}
		printf("%d\n", Max);
	}
	return 0;
}