L. Ray in the tube

http://codeforces.com/gym/101911/problem/L

题意： 给出n个点在y1的水平线上，给出m个点在y2的水平面上，一道光线可以在这两个水平线中折射，从任意位置开始，问最多可以经过多少了点；

思路：枚举间隔，间隔多少2的k次幂；再取点数最大的；tp[n+m+1]=1e9没写，是不会更新全部都tp  1~n+m全部相同时的情况的~~

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=3e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

int a[maxn],b[maxn];
int tp[maxn];
int main()
{
    FASTIO;
    #define endl '\n'

    int n,y1;
    cin>>n>>y1;
    for(int i=1;i<=n;i++) cin>>a[i];
    int m,y2;
    cin>>m>>y2;
    for(int i=1;i<=m;i++) cin>>b[i];
    int ans=2;
    tp[n+m+1]=2e9+9;
    for(int i=2;i<=int(1e9);i<<=1)
    {
        int d=i;
        for(int j=1;j<=n;j++) tp[j]=(a[j])%d;
        for(int j=1;j<=m;j++) tp[j+n]=(b[j]+d/2)%d;
        sort(tp+1,tp+n+m+1);
        int st=1;
        for(int j=2;j<=n+m+1;j++)
        {
            if(tp[j]!=tp[j-1])
            {
                ans=max(ans,j-st);
                st=j;
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}