1105 Spiral Matrix （25 分）（C++）

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

解题思路：

1.关于m,n的计算，由于开方后，得到的值一定是小于等于该数的平方，所以我们先计算n

2.定义一个二维数组result，result[i][j]记录行号为i，列号为j的值

3.在遍历过程中，一圈一圈地遍历，共 k 圈，k=n/2，每一圈在遍历时分为四条边，每条边的最后一个值留作下一条边的第一个值。

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
    int N,m,n,cnt=0,k,i,j,wide,high,d;
    cin>>N;
    std::vector<int> v(N);
    for(i=0;i<N;i++)
        scanf("%d",&v[i]);
    sort(v.begin(), v.end(),greater<int>());
    n=sqrt(N);
    while(N%n!=0)
        n--;
    m=N/n;k=n/2;
    vector<vector<int>> result(m,vector<int> (n));
    for(d=0;d<k;d++){
        i=d;wide=n-d-1;high=m-d-1;
        for(j=d;j<wide;j++)
            result[i][j]=v[cnt++];
        for(;i<high;i++)
            result[i][j]=v[cnt++];
        for(;j>d;--j)
            result[i][j]=v[cnt++];
        for(;i>d;--i)
            result[i][j]=v[cnt++];
    }
    i=d,j=d;
    while(cnt<N)
    	result[i++][j]=v[cnt++];
    for(i=0;i<m;i++){
        for(j=0;j<n;j++){
            if(j!=0)
                printf(" ");
            printf("%d",result[i][j]);
        }
        printf("\n");
    }
}