#define ll long long
#define debug cout<<'/n'<<"debug"<<'/n';
#include<bits/stdc++.h>
#include<deque>
using namespace std;
bool find(deque<int> q)
{
deque<int>::iterator itr;
itr = find(q.begin(),
q.end(),q.size());
if(itr != q.end()){return true;}
else{return false;}
}
signed main(){
const char endl = '\n';
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int memory_size,n;
cin>>memory_size>>n;
deque<int>memory;
int sum=0,m[n];
for(int i=0;i<n;i++){cin>>m[i];}
for(int i=0;i<n;i++){
if(find(memory)){continue;}
else{
sum++;
if(memory.size()==3){
memory.pop_front();
memory.push_back(m[i]);
}
else{
memory.push_back(m[i]);
}
}
}
cout<<sum;
}
```[提交记录](https:
