显示代码纯文本
#include<stdio.h>
int main()
{
freopen("translate.in","r",stdin);
freopen("translate.out","w",stdout);
int n,m,i,i1,k,p,t[1002],quene[1002],head,tail,ii;
scanf("%d %d",&n,&m);
for(i=1;i<=m;i++)
scanf("%d",&t[i]);
p=0;
head=tail=1;
ii=1;
while(tail-head<n)
{
k=0;
for(i1=1;i1<ii;i1++)
if(t[ii]==t[i1]&&k==0)
{
k++;
p++;
}
if(k==0)
{
quene[tail]=t[ii];
tail++;
}
ii++;
}
for(i=ii;i<=m;i++)
{
k=0;
for(i1=head;i1<tail;i1++)
if(t[i]==quene[i1])
{
k++;
p++;
}
if(k==0)
{
quene[tail]=t[i];
tail++;
}
if(tail-head>n)
head++;
}
printf("%d",m-p);
return 0;
}