2845670_wa.java

北大大牛代码 1240道题的原代码 超级权威

import java.util.*;
import java.math.*;

public class Main {
  
    public static void main(String[] args) {
        
        Scanner cin = new Scanner (System.in);
        int n, i, j, k, r, t, x;
        int map[][] = new int [371][371];
        int ansi, ansj, ans;
        Random r1 = new Random(); 
        Random r2 = new Random(); 
        
        n = cin.nextInt();
        for(i = 1; i <= n; i++)
            for(j = 1; j <= n; j++)
                map[i][j] = cin.nextInt();
        t = 30000;
        ansi = ansj = ans = 1;
        while(t!=0)
        {
            t--;
            i = (r1.nextInt()%n+n)%n+1;
            j = (r2.nextInt()%n+n)%n+1;
            x = n-i;
            if( x > n-j )x = n-j;
            if( x < ans )continue;
            for( k = x; k >= ans; k-- )
            {
                for( r = 0; r <= k; r++ )
                {
                    if( !( map[i][j+r] == map[i+k][j+r] && map[i+r][j] == map[i+r][j+k] ) )break;
                }
                if( r > k )
                {
                    ansi = i;
                    ansj = j;
                    ans = k+1;
                    break;
                }
            }
        }
        System.out.println(ansi+" "+ansj+" "+ans);
    }
    
}