用的哈希加双指针，除了#1、3AC，其他全都WA了

#include<bits/stdc++.h>
using namespace std;
#define mod (int)(1e7+19)
#define base 1003
int n,m,ans1,ans2;
int t[mod+100],nowt;
string s1;
string s2[200001];
vector<int>v;
inline int h(string s){//h means hash 
	long long ans=0;
	for(int i=0;i<s.size();i++){
		ans*=base;
		ans+=s[i]-'a';
		ans%=mod;
	}
	return ans;
}
inline bool find(int x){
	for(int i=0;i<v.size();i++){
		if(v[i]==x)return 1;
	}
	return 0;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>s1;
		v.push_back(h(s1));
	}
	cin>>m;
	for(int i=1;i<=m;i++){
		cin>>s2[i];
	}
	int l=0,r=0;
	while(l<=r){
		while(nowt<n&&l<=m&&r<=m){
			int x=h(s2[++r]);
			t[x]++;
			if(t[x]==1&&find(x))nowt++;//,printf("%d is right\n",r);
			if(nowt>ans1){
				ans1=nowt;
				ans2=r-l;
			}else if(nowt==ans1&&ans2>r-l){
				ans2=r-l;
			}
		} 
		while(nowt==n&&l<=m&&r<=m){
			int x=h(s2[++l]);
			t[x]--;
			if(!t[x]&&find(x))nowt--;
			if(nowt==ans1&&ans2>r-l){
				ans2=r-l;
			}
		}
		if(l>m||r>m)break;
	}
	cout<<ans1<<'\n'<<ans2;
	return 0;
}