题目链接:https://www.luogu.org/problemnew/show/P1540
题目过于简单,就不讲解了
代码
//
// Created by Leo Lee on 2019/5/31.
//
#include <iostream>
#include <string.h>
#include <vector>
#include <algorithm>
using namespace std;
int M,N;
int times = 0;
vector<int> vec;
void fun(int in);
void show();
int main(){
cin>>M>>N;
int in;
for(int i = 0;i<N;i++){
scanf("%d",&in);
fun(in);
}
cout<<times<<endl;
return 0;
}
void fun(int in){
for(int i = 0;i<vec.size();i++){
if(vec[i] == in){
return ;
}
}
//没有找到
if(vec.size()<M){
vec.push_back(in);
times++;
}else{
vec.erase(vec.begin(),vec.begin()+1);
vec.push_back(in);
times++;
}
//show();
}
void show(){
for(int i = 0;i<vec.size();i++){
cout<<vec[i]<<" ";
}
cout<<endl;
}