https://www.luogu.org/problemnew/show/P1540

题解：本来想用队列写的

但是队列没有迭代器，也没有find；

所以开了个数组，模拟一下队列，感觉棒棒哒

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
typedef __int128 lll;
const int N=10000;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int a[N];
int b[N];
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d%d",&m,&n);
    int l=1,r=1;
    int ans=0;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        int flag=1;
        for(int j=l;j<r;j++)
            if(b[j]==a[i])flag=0;
        if(flag){
            if(r-l>=m)
                l++;
            b[r++]=a[i];
            ans++;
        }
    }

    cout << ans << endl;

    //cout << "Hello world!" << endl;
    return 0;
}