机器翻译

#include<iostream>
#include<cmath>
#include <algorithm>
#include<queue>
using namespace std;


queue<int> ram;
int m,n;
bool in[1001];


int z=1;
int ans=0;


int main()
{
cin>>m>>n;
for(int i=1; i<=n; i++)
{
int a;
cin>>a;
if(!in[a])
{
if(ram.size()<m)
{


ram.push(a);
in[a]=1;
ans++;
}


else
{
in[ram.front()]=0;
ram.pop();


ram.push(a);
in[a]=1;
ans++;


}


}


}


cout<<ans;
return 0;
}