bzoj1170 [Balkan2007]Cipher（二维hash）

恩，垃圾读入。
就是个二维hash，然后排序找众数。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;
#define ull unsigned long long
#define N 1010
#define k1 11113
#define k2 11117
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,ans=0,ansid=0;char s[N][N];
ull hs[N][N],bin1[N],bin2[N];
struct data{
    ull hs;int x,y;
    friend bool operator<(data a,data b){
        return a.hs==b.hs?(a.x==b.x?a.y<b.y:a.x<b.x):a.hs<b.hs;
    }
}a[N*N];
int main(){
//  freopen("a.in","r",stdin);
    scanf("%d %d\n",&n,&m);bin1[0]=bin2[0]=1;
    for(int i=1;i<=m;++i) bin1[i]=bin1[i-1]*k1;
    for(int i=1;i<=n;++i) bin2[i]=bin2[i-1]*k2;
    for(int i=1;i<=n;++i) fread(s[i]+1,m+1,1,stdin);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j) hs[i][j]=hs[i][j-1]*k1+s[i][j];
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j) hs[i][j]+=hs[i-1][j]*k2;
    int aa=read(),b=read(),tot=0;
    for(int i=aa;i<=n;++i)
        for(int j=b;j<=m;++j)
            a[++tot].x=i-aa+1,a[tot].y=j-b+1,
            a[tot].hs=hs[i][j]-hs[i-aa][j]*bin2[aa]-hs[i][j-b]*bin1[b]+hs[i-aa][j-b]*bin2[aa]*bin1[b];
    sort(a+1,a+tot+1);int cnt=0,X=0,Y=0;
    for(int i=1;i<=tot;++i){
        if(i==1||a[i].hs!=a[i-1].hs) cnt=0;cnt++;
        if(cnt>ans) ans=cnt,ansid=i;
    }printf("%d %d\n",aa,b);
    for(int i=1;i<=aa;++i){
        for(int j=1;j<=b;++j) putchar(s[a[ansid].x+i-1][a[ansid].y+j-1]);puts("");
    }printf("%d\n",ans);
    for(int i=ansid-ans+1;i<=ansid;++i)
        printf("%d %d\n",a[i].x,a[i].y);
    return 0;
}