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\times n$ must be equal to $N$; $m\le 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 <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

bool cmp(int a, int b){
    return a > b;
}

int main(){
    int N, m, n;
    vector<int> d;
    vector<vector<int> > mp;
    scanf("%d", &N);
    d.resize(N);
    for(int i=0; i<N; i++)
        scanf("%d", &d[i]);
    sort(d.begin(), d.begin()+N, cmp);
    for(int i=N; i>=sqrt(N); i--){
        if(N%i == 0){
            m = i;
            n = N/m;
        }
    }
    //printf("%d %d\n", m, n);
    mp.resize(m);
    for(int i=0; i<m; i++)
        mp[i].resize(n);
    int cnt = 0, level = 0;
    while(cnt < N){
        for(int i=level; i<n-level && cnt < N; i++){
            mp[level][i] = d[cnt++];
        }
        for(int i=level+1; i<m-level-1 && cnt < N; i++){
            mp[i][n-level-1] = d[cnt++];
        }
        for(int i=n-level-1; i>=level && cnt < N; i--){
            mp[m-level-1][i] = d[cnt++];
        }
        for(int i=m-level-2; i>= level+1 && cnt < N; i--){
            mp[i][level] = d[cnt++];
        }
        level++;
    }
    for(int i=0; i<m; i++){
        for(int j=0; j<n; j++){
            if(j)
                printf(" ");
            printf("%d", mp[i][j]);
        }
        printf("\n");
    }
    return 0;
}