Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- */
- //#pragma comment(linker, "/STACK:16777216")
- #include <fstream>
- #include <iostream>
- #include <string>
- #include <complex>
- #include <math.h>
- #include <set>
- #include <vector>
- #include <map>
- #include <queue>
- #include <stdio.h>
- #include <stack>
- #include <algorithm>
- #include <list>
- #include <ctime>
- #include <memory.h>
- #include <ctime>
- #define y0 sdkfaslhagaklsldk
- #define y1 aasdfasdfasdf
- #define yn askfhwqriuperikldjk
- #define j1 assdgsdgasghsf
- #define tm sdfjahlfasfh
- #define lr asgasgash
- #define eps 1e-9
- #define M_PI 3.141592653589793
- #define bs 1000000007
- #define bsize 512
- using namespace std;
- long long pw[1<<20];
- int ar[2050][2050];
- long long su[2050][2050],sd[2050][2050],sl[2050][2050],sr[2050][2050];
- int ans,ai,aj;
- int l,r;
- int n,m;
- bool check(int a,int b,int side)
- {
- long long val=su[a][b]-su[a-side][b];
- val*=pw[10000-(a-side)];
- long long val1=sr[a][b]-sr[a][b+side];
- val1*=pw[10000-(m-(b+side-1))];
- if (val1!=val)
- return false;
- val1=sd[a][b]-sd[a+side][b];
- val1*=pw[10000-(n-(a+side-1))];
- if (val1!=val)
- return false;
- val1=sl[a][b]-sl[a][b-side];
- val1*=pw[10000-(b-side)];
- if (val1!=val)
- return false;
- return true;
- }
- int main(){
- //freopen("blind.in","r",stdin);
- //freopen("blind.out","w",stdout);
- //freopen("F:/in.txt","r",stdin);
- //freopen("F:/output.txt","w",stdout);
- //ios_base::sync_with_stdio(0);
- //cin.tie(0);
- pw[0]=1;
- for (int i=1;i<=10000;i++)
- pw[i]=pw[i-1]*173;
- cin>>n>>m;
- for (int i=1;i<=n;i++)
- for (int j=1;j<=m;j++)
- {
- scanf("%d",&ar[i][j]);
- }
- for (int i=1;i<=n;i++)
- for (int j=1;j<=m;j++)
- {
- su[i][j]=su[i-1][j]+ar[i][j]*pw[i];
- sl[i][j]=sl[i][j-1]+ar[i][j]*pw[j];
- }
- for (int i=n;i;--i)
- for (int j=m;j;--j)
- {
- sd[i][j]=sd[i+1][j]+ar[i][j]*pw[n-i+1];
- sr[i][j]=sr[i][j+1]+ar[i][j]*pw[m-j+1];
- }
- ans=0;
- for (int i=1;i<=n;i++)
- for (int j=1;j<=m;j++)
- {
- l=ans;
- r=min(i,j);
- r=min(r,n-i+1);
- r=min(r,m-j+1);
- while (l<r)
- {
- int mid=l+r+1;
- mid/=2;
- if (check(i,j,mid))
- l=mid;
- else
- r=mid-1;
- }
- if (l>ans)
- {
- ans=l;
- ai=i;
- aj=j;
- }
- }
- cout<<ans-1<<" "<<ai<<" "<<aj<<endl;
- //cin.get();cin.get();
- return 0;}
Advertisement
Add Comment
Please, Sign In to add comment