[codeforces 1294D] MEX maximizing 模是最终归宿

[codeforces 1294D] MEX maximizing 模是最终归宿

总目录详见https://blog.csdn.net/mrcrack/article/details/103564004

在线测评地址http://codeforces.com/contest/1294/problem/D

 

Problem	Lang	Verdict	Time	Memory
D - MEX maximizing	GNU C++11	Accepted	171 ms	1400 KB

//思路源自此文https://blog.csdn.net/Luoriliming/article/details/104075725
//模是最终归宿。

#include <stdio.h>
int a[400010];
int main(){
	int q,x,y,t=0;
	scanf("%d%d",&q,&x);
	while(q--){
		scanf("%d",&y);
		a[y%x]++;
		while(a[t%x])a[t%x]--,t++;
		printf("%d\n",t);	
	}
	return 0;
}