3020105_tle.java

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

import java.util.*;

public class Main 
{
	static int n;
	static int mtr[][] = new int [201][201];
	
	static int abs(int num)
	{
		if(num < 0)
			return -num;
		else
			return num;
	}

	static int find_nearest(int a,int b)
	{
		int i, j, dis, num, ret;
		int max = 2100000000;

		num = 0;ret = 0;
		for(i = 0; i < n; i++)
		{
			for(j = 0; j < n; j++)
			{
				if((i==a&&j==b)||mtr[i][j]==0)
				{
					continue;
				}
				dis = abs(i-a)+abs(j-b);
				if(dis < max)
				{
					ret = mtr[i][j];
					max = dis;
					num = 1;
				}
				else
				{
					if(dis == max)
					{
						num ++;
					}
				}
			}
		}
		if(num==1)
		{
			return ret;
		}
		else
		{
			return 0;
		}
	}
	public static void main(String[] args) 
	{
		Scanner cin = new Scanner (System.in);
		int i, j;
		
		
		n = cin.nextInt();
		for(i = 0; i < n; i++)
		{
			for(j = 0; j < n; j++)
			{
				mtr[i][j] = cin.nextInt();
			}
		}
		for(i = 0; i < n; i++)
		{
			for(j = 0; j < n; j++)
			{
				if(mtr[i][j]!=0)
				{
					System.out.print(mtr[i][j]);
				}
				else
				{
					System.out.print(find_nearest(i,j));
				}
				if(j==n-1)
					System.out.println();
				else
					System.out.print(" ");
			}
		}
	}
}