P1540 机器翻译

题面:https://www.luogu.org/problem/P1540

本题直接开一个双端队列模拟题意即可.
Code:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<ctime>
#include<queue>
using namespace std;
const int N=1005;
int m,n,a[N],tot,ans;
bool vis[N];
deque<int> Q;
int main(){
	scanf("%d%d",&m,&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	for(int i=1;i<=n;i++){
		if(!vis[a[i]]){
			++tot;
			if(tot>m){
				vis[Q.front()]=0;
				Q.pop_front();
				if(!vis[a[i]]){
					Q.push_back(a[i]);
					vis[a[i]]=1;
					ans++;
				}
			}
			else{
				Q.push_back(a[i]);
				vis[a[i]]=1;
				ans++;
			}
		}
	}
	printf("%d\n",ans);
	return 0;
}