luoguP1540 机器翻译

水题

#include<bits/stdc++.h>
using namespace std;

int n,m,a,ans=0;
queue<int>q;
bool judge[1005];

int main(){
	cin>>m>>n;memset(judge,false,sizeof(judge));
	for(int i=1;i<=n;i++){
		cin>>a;
		if(judge[a]==false){
			judge[a]=true;
			q.push(a);
			ans++;
		}
		if(q.size()>m){
			judge[q.front()]=false;
			q.pop();
		}
	}
	cout<<ans<<endl;
}