luogu1540 [NOIp2011]机器翻译 (队列)

#include<bits/stdc++.h>
#define pa pair<int,int>
#define CLR(a,x) memset(a,x,sizeof(a))
using namespace std;
typedef long long ll;
const int maxn=1010,maxm=110;

inline ll rd(){
    ll x=0;char c=getchar();int neg=1;
    while(c<'0'||c>'9'){if(c=='-') neg=-1;c=getchar();}
    while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
    return x*neg;
}

queue<int> q;
int N,M;
bool ins[maxn];

int main(){
    //freopen("","r",stdin);
    int i,j,k,ans=0;
    M=rd(),N=rd();
    for(i=1;i<=N;i++){
        int x=rd();
        if(!ins[x]){
            ans++;
            if(q.size()>=M){
                ins[q.front()]=0;q.pop();
            }
            ins[x]=1;q.push(x);
        }
    }
    printf("%d
",ans);
    return 0;
}