1105 Spiral Matrix (25 分)

1105 Spiral Matrix (25 分)

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^​4​​ . 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<bits/stdc++.h>
using namespace std;
bool cmp(int a, int b) {
	return a > b;
}
int main() {
	int N, n, m;
	scanf("%d", &N);
	vector<int> v(N);
	for (int i = 0; i < N; i++) {
		scanf("%d", &v[i]);
	}
	sort(v.begin(), v.end(), cmp);
	for (n = sqrt(1.0 * N); n >= 1; n--) {
		if (N % n == 0) {
			m = N / n;
			break;
		}
	}
	vector<vector<int> > number(m, vector<int> (n));
	int row = m / 2 + m % 2, t = 0;
	for (int i = 0; i < row; i++) {
		for (int j = i; j < n - i && t <= N - 1; j++)
			number[i][j] = v[t++];
		for (int j = i + 1; j < m - i - 1 && t <= N - 1; j++)
			number[j][n - i - 1] = v[t++];
		for (int j = n - i - 1; j >= i && t <= N - 1; j--)
			number[m - i - 1][j] = v[t++];
		for (int j = m - i - 2; j > i && t <= N - 1; j--)
			number[j][i] = v[t++];
	} 
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			if (j != 0) printf(" ");
			printf("%d", number[i][j]);
		}
		printf("\n");
	}
}