2386.cpp

这是哈尔滨工业大学acmOJ的源代码

/* This Code is Submitted by wywcgs for Problem 2386 on 2006-09-28 at 15:52:05 */
#include <cstdio>
#include <algorithm>
using namespace std;
 
const int N = 10240;
 
int main()
{
	int num[N], n, k;
	
	while(scanf("%d %d", &n, &k) != EOF) {
		memset(num, -1, sizeof(num));
		int r = 0, m = 0;
		for(int i = 0; i < n; i++) {
			int a; scanf("%d", &a); a--;
			if(num[a] != r) { num[a] = r; m++; }
			if(m == k) { m = 0; r++; }
		}
		printf("%d\n", r+1);
	}
	
	return 0;
}