本人居然512ms……各位大牛又没有什么更好的方法，望不吝赐教哦～

#include<iostream>
using namespace std;

int main()
{
	int claim,zib;cin>>claim>>zib;
	int reader;
	bool* occur = new bool [zib+1];
	memset(occur,false,(zib+1)*sizeof(bool));
	int remain = zib,count = 1;
	bool oddflag = false;
	while(claim != 0)
	{
		cin>>reader;
		if(oddflag == occur[reader])
		{
			remain--;
			occur[reader] = !occur[reader];
		}
		if(remain == 0)
		{
			remain = zib;
			count++;
			oddflag = !oddflag;
		}
		claim--;
	}
	cout<<count<<endl;
	delete [] occur;
	return 0;
}