1050. 螺旋矩阵(25)

非常易错的一道题。核心的考点就在所开数组空间的问题上。只能说长见识了吧。

// 2017/10/14 NCU // PAT-B 1053// scienceZ#include <cstdio>#include <cmath>#include <cstdlib>#include <iostream>#include <algorithm>using namespace std;int N, m, n;int store[10100];int arr[10010][10010];void solve(){  int i = 1, j = 1;  arr[i][j] = store[N-1];  N--;  while(N-1>=0){    while(j < n && arr[i][j+1] == 0)  { arr[i][++j] = store[N-1]; N--;  }     while(i < m && arr[i+1][j] == 0)  { arr[++i][j] = store[N-1]; N--;  }     while(j > 1 && arr[i][j-1] == 0) { arr[i][--j] = store[N-1]; N--;  }     while(i > 1 && arr[i-1][j] == 0) { arr[--i][j] = store[N-1]; N--;  }   }  return;}int main(){    cin >> N;  for (int i = 0; i<N; i++) cin >> store[i];  sort(store, store+N);  n = floor(sqrt(N));    m = N/n;  while(n*m != N){    n--;    m = N/n;  }    solve();  for(int i = 1; i<=m; i++){    for (int j = 1; j<=n-1; j++)      printf("%d ", arr[i][j]);    printf("%d\n", arr[i][n]);  }    return 0;}