mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
51 lines
1.3 KiB
C++
51 lines
1.3 KiB
C++
#include<iostream>
|
|
#include<cstdio>
|
|
#include<cstdlib>
|
|
#include<cstring>
|
|
#include<string>
|
|
#include<queue>
|
|
#include<algorithm>
|
|
#include<map>
|
|
#include<iomanip>
|
|
#define INF 99999999
|
|
using namespace std;
|
|
const int MAX=100000+10;
|
|
int s[MAX],num[MAX],pos[MAX];
|
|
int mark[MAX];
|
|
int main(){
|
|
int n,m,q,a;
|
|
while(cin>>n>>m,n+m){
|
|
memset(mark,0,sizeof mark);
|
|
memset(pos,-1,sizeof pos);
|
|
for(int i=0;i<n;++i){
|
|
scanf("%d",&s[i]);
|
|
if(pos[s[i]] == -1)pos[s[i]]=i;
|
|
}
|
|
s[n]=n;
|
|
for(int i=1;i<=m;++i){
|
|
scanf("%d",&q);
|
|
int l=n,r=-1,maxlen=INF;
|
|
for(int j=0;j<q;++j){
|
|
scanf("%d",&a);
|
|
num[a]=0;
|
|
mark[a]=i;
|
|
if(pos[a]>r)r=pos[a];
|
|
if(pos[a]<l)l=pos[a];
|
|
}
|
|
for(int j=l;j<=r;++j)++num[s[j]];
|
|
maxlen=r-l+1;
|
|
while(r<n){
|
|
--num[s[l]];
|
|
if(num[s[l]] == 0){
|
|
while(++r<n && s[r] != s[l])++num[s[r]];
|
|
num[s[r]]=1;
|
|
}
|
|
while(++l<=r && mark[s[l]] != i);
|
|
if(r<n && maxlen>r-l+1)maxlen=r-l+1;
|
|
}
|
|
cout<<maxlen<<endl;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|