3080817_ce.java

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

import java.util.*;

public class Main
{
	Scanner cin = new Scanner (System.in);

	public static void main(String [] args)
	{
		new Main().solve();
	}
	
	private void solve()
	{
		int cas, h, l, t, max;
		int tow[][] = new int [52][52];

		cas = cin.nextInt();
		while(cas > 0)
		{
			cas--;t = 0;
			h = cin.nextInt();
			l = cin.nextInt();
			max = -1;
			for(int i = 0; i < h; i++)
			{
				for(int j = 0; j < l; j++)
				{
					tow[i][j] = cin.nextInt();
					if(tow[i][j]!=-1)
					{
						t += 20*i;
						if(tow[i][j] > max)
						{
							max = tow[i][j];
						}
					}
				}
			}
			for(int i = 1; i <= max; i++)
			{
				t += find(i,tow);
			}
			System.out.println(t);
		}
	}

	private int find(int num,int [][]tow)
	{
		int ret = 0, cnt = 0;
		int tmp[] = new int [52];

		for(int i = 0; i < h; i++)
		{
			for(int j = 0; j < l; j++)
			{
				if(tow[i][j]==num)
				{
					tow[i][j] = -1;
					if(j < l-j)
					{
						ret = j;
					}
					else
					{
						ret = l-j;
					}
					for(int k = j; cnt < l; k++)
					{
						tmp[cnt++] = tow[i][k%l];
					}
					for(int k = 0; k < l; k++)
					{
						tow[i][k] = tmp[k];
					}
					return ret;
				}
			}
		}
	}
}