1105. Spiral Matrix

1105. Spiral Matrix (25)

时间限制

150 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

This time your job is to fill a sequence of N positive integers into a spiral matrix in non-increasing order. A spiral matrix is filled in from the first element at the upper-left corner, then move in a clockwise spiral. The matrix has m rows and n columns, where m and n satisfy the following: m*n must be equal to N; m>=n; and m-n is the minimum of all the possible values.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N. Then the next line contains N positive integers to be filled into the spiral matrix. All the numbers are no more than 10⁴. The numbers in a line are separated by spaces.

Output Specification:

For each test case, output the resulting matrix in m lines, each contains n numbers. There must be exactly 1 space between two adjacent numbers, and no extra space at the end of each line.

Sample Input:

12
37 76 20 98 76 42 53 95 60 81 58 93

Sample Output:

98 95 93
42 37 81
53 20 76
58 60 76

先找出符合题意的行和列并且对一维数组排序，然后按照顺序访问二维数组，这个过程类似于状态机，可以用判断或选择语句，最后输出二维数组。

#include<iostream>
#include<cmath>
#include<algorithm>

using namespace std;

int m,n,N;
int a[10001];
int ans[101][101];

bool cmp(int x,int y)
{
	return x>y;
}

void findmn()
{
	int mt=N,nt=1;
	for(int i=1;i<=sqrt(double(N));i++)
		for(int j=i;j*i<=N;j++)
			if(j*i==N&&j-i<mt-nt)
			{
				mt=j;
				nt=i;
			}
	m=mt;n=nt;
}

int main()
{
	cin>>N;
	for(int i=1;i<=N;i++)
		cin>>a[i];
	sort(a+1,a+N+1,cmp);
	findmn();

	int u=1,d=m,l=1,r=n;
	int i=1,j=1;
	int state=1;//1 right,2 down,3 left,4 up
	int cnt=1;
	while(cnt<=N)
	{
		if(state==1)
		{
			ans[i][j]=a[cnt];
			if(j==r)
			{
				state=2;
				u++;
				i++;
			}
			else
				j++;
		}
		else if(state==2)
		{
			ans[i][j]=a[cnt];
			if(i==d)
			{
				state=3;
				r--;
				j--;
			}
			else
				i++;
		}
		else if(state==3)
		{
			ans[i][j]=a[cnt];
			if(j==l)
			{
				state=4;
				i--;
				d--;
			}
			else
				j--;
		}
		else
		{
			ans[i][j]=a[cnt];
			if(i==u)
			{
				state=1;
				j++;
				l++;
			}
			else
				i--;
		}
		cnt++;
	}
	for(int i=1;i<=m;i++)
	{
		for(int j=1;j<n;j++)
			cout<<ans[i][j]<<" ";
		cout<<ans[i][n]<<endl;
	}
	return 0;
}