用的哈希+双指针，感觉应该没有数组越界？（雾

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<bitset>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#define int long long

using namespace std;

int read()
{
	int ans=0,f=1;
	char c=getchar();
	while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){ans=ans*10+c-'0';c=getchar();}
	return ans*f;
}

const int N=1e3+5,M=1e5+5,mod1=314159,mod2=19260817337,base=131;
int n,m,ans1,ans2,now;
char s[55],t[M][55];

vector<int> a[mod1*2+5],vis[mod1*2+5];

inline int hash(char x[],int mod);

signed main()
{
	n=read();
	for(int i=1;i<=n;++i)
	{
		scanf("%s",s+1);
		int h1=hash(s,mod1);
		a[h1].push_back(hash(s,mod2));
		vis[h1].push_back(0);
	}
	m=read();
	for(int i=1;i<=m;++i)
		scanf("%s",t[i]+1);
	int l=1,r=0;
	while(r<=m-1)
	{
		++r;
		int h1=hash(t[r],mod1),h2=hash(t[r],mod2),pos;
		for(int i=0;i<a[h1].size();++i)
			if(a[h1][i]==h2)
			{
				pos=i;
				break;
			}
		if(!vis[h1][pos]) now++;
		vis[h1][pos]++;
again:	h1=hash(t[l],mod1),h2=hash(t[l],mod2);
		for(int i=0;i<a[h1].size();++i)
			if(a[h1][i]==h2)
			{
				pos=i;
				break;
			}
		if(vis[h1][pos]>=2)
		{
			l++,vis[h1][pos]--;
			goto again;
		}
		if(now>ans1) ans1=now,ans2=r-l+1;
		else ans2=min(ans2,r-l+1);
	}
	printf("%lld %lld",ans1,ans2);
	return 0;
}

inline int hash(char x[],int mod)
{
	int res=0,len=strlen(x+1);
	for(int i=1;i<=len;++i)
		res=(res*base+x[i])%mod;
	return res;
}