URAL

During a discussion of problems at the Petrozavodsk Training Camp, Vova and Sasha argued about who of them could in 300 minutes find a pair of equal squares of the maximal size in a matrix of size N × M containing lowercase English letters. Squares could overlap each other but could not coincide. He who had found a pair of greater size won. Petr walked by, looked at the matrix, said that the optimal pair of squares had sides K, and walked on. Vova and Sasha still cannot find this pair. Can you help them?

Input

The first line contains integers N and M separated with a space. 1 ≤  N,  M ≤ 500. In the next N lines there is a matrix consisting of lowercase English letters, M symbols per line.

Output

In the first line, output the integer K which Petr said. In the next two lines, give coordinates of upper left corners of maximal equal squares. If there exist more than one pair of equal squares of sizeK, than you may output any of them. The upper left cell of the matrix has coordinates (1, 1), and the lower right cell has coordinates (N,  M). If there are no equal squares in the matrix, then output 0.

Example

input	output
5 10 ljkfghdfas isdfjksiye pgljkijlgp eyisdafdsi lnpglkfkjl	3 1 1 3 3

    先要对每一个字符串进行哈希预处理，哈希处理后，把哈希的值在根据行数哈希一遍

     没存过的就存一遍， 找到有没有相同的，

    这个二分还是比较好写的

   这个二维哈希就有点懵逼  

   

#include <iostream>
#include <cstdio>
#include <string>
#include <map>
#include <cstring>
#include <algorithm>
using namespace std;

typedef long long LL;
typedef unsigned long long ull;
typedef pair<int, int> ii;
const int maxn = 510;
const ull p = 1e12 + 7, pt = 19191919191919;

struct h {
    ull ha[maxn][maxn], xp[maxn], sz;
    void init1(int n) {
        sz = n;
        xp[0] = 1;
        for (int i = 1 ; i <= sz ; i++)
            xp[i] = xp[i - 1] * p;
    }
    void init2(int id, const string &str) {
        ha[id][sz] = 0;
        for (int i = sz - 1 ; i >= 0 ; i--)
            ha[id][i] = ha[id][i + 1] * p + (str[i] - 'a' + 1);
    }
    ull gethash(int id, int st, int len) {
        return ha[id][st] - ha[id][st + len] * xp[len];
    }
} Hash;
string s[maxn];
map< ull, ii>mp;
int n, m, ans;
ii ans1, ans2;
ull hat[maxn], xpt[maxn];
void initxpt(int n) {
    xpt[0] = 1;
    for (int i = 1 ; i <= n ; i++ )
        xpt[i] = xpt[i - 1] * pt;
}
int check(int x) {
    mp.clear();
    ull t;
    for (int j = 0 ; j + x - 1 < m ; j++ ) {
        hat[0] = 0;
        for (int i = 1 ; i <= n ; i++)
            hat[i] = hat[i - 1] * pt + Hash.gethash(i, j, x);
        for (int k = x ; k <= n ; k++) {
            t = hat[k] - hat[k - x] * xpt[x];
            if (mp.find(t) != mp.end()) {
                ans1 = mp[t];
                ans2 = ii(k - x + 1, j + 1);
                return 1;
            } else mp[t] = ii(k - x + 1, j + 1);
        }
    }
    return 0;
}
int main() {
    cin >> n >> m;
    Hash.init1(m);
    for (int i = 1 ; i <= n ; i++) {
        cin >> s[i];
        Hash.init2(i, s[i]);
    }
    initxpt(n);
    ans = 0;
    int l = 0, r = min(n, m) + 1, mid;
    while(l <= r) {
        mid = (l + r) >> 1;
        if(check(mid)) {
            ans = mid;
            l = mid + 1;
        } else r = mid - 1;
    }
    if(ans) cout << ans << "
" << ans1.first << " " << ans1.second << "
" << ans2.first << " " << ans2.second << endl;
    else cout << ans << "
";
    return 0;
}