1989.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

#include <stdio.h>
#include <memory.h>

int sign[10001];

int main()
{
	int n,k,c,a,l;
	
	scanf( "%d%d", &n, &k );
	memset( sign, 0, sizeof(bool) );

	l = 1, c = 0;
	while(n--)
	{
		scanf( "%d", &a );
		c += l - sign[a];
		sign[a] = l;
		if( c == k ) l++, c=0;
	}
	printf( "%d\n", l );

	return 0;
}