#include<cstdio>
#include<algorithm>
#include<map>
using namespace std;
const int Kmax=1e5+50;
int a[Kmax];
int b[Kmax];
map<int,int> mp;
int main()
{
int t,n,len;
scanf("%d",&t);
while (t--) {
mp.clear();
len=1;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++)
{
scanf("%d",&b[i]);
mp[b[i]-a[i]]++;
}
map<int,int>::iterator it;
for(it=mp.begin();it!=mp.end();it++)
{
len=max(len,it->second);
}
printf("%d\n",len);
}
return 0;
}
The 15th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple - B
最新推荐文章于 2019-04-28 16:31:30 发布