双端队列挂掉

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
deque<int> q; 
int m,n,a[1000005],ans;
bool find(int k){
	deque<int> v;
    v = q;
    while(!v.empty()){
        v.pop_front();
        if(v.front()==k) return 1;
    }
    return 0;
}
int main(){
	cin >> m >> n;
	rep(i,1,n){
		cin>>a[i];
		if(!find(a[i])){
            ans++;
            q.push_back(a[i]);
        }else{
            if(q.size()>m){
                q.pop_front();
                q.push_back(a[i]);
            }
        }
	}
	cout << ans;
    return 0;
}