题解 | 机器翻译

#include<bits/stdc++.h>
using namespace std;
int main(){
    int m,n,miss = 0;
    deque<int> dic;
    cin>>m>>n;
    for(int i =0;i<n;i++){
        int word;
        cin>>word;
        bool found= false;
        for(int x:dic){
            if(x == word)
            {
                found = true;
                break;
            }
    }
    if(!found){
        miss++;
        if(dic.size()<m){
            dic.push_back(word);
        }
        else{
            dic.pop_front();
            dic.push_back(word);
        }
    }
}
    cout<<miss;
}