题目翻译:
给定一个序列,按照降序序列打印其螺旋矩阵(要求尽可能“正方形”,同时行数大于等于宽数)
题解思路:
对于下边这个6*5矩阵,若现在要求得红色方块在降序序列中的序号,那么我们应该首先求得绿色方块的序号(对于这个序号,我们只需要让黄色圈包围的减去白色区域即可),求得相应下标然后在降序序列中打印输出即可
也可以参考下边这个博客:定义“上下左右”四个步骤实现
代码:
#include <bits/stdc++.h>
using namespace std;
const int N = 5000 + 5;
int a[N][N], d[N * N];
int n, m, t, k, q;
int main() {
cin >> k;
for (int i = 1; i <= k; i++) cin >> d[i];
sort(d + 1, d + k + 1, greater<>());
for (int i = 1; i * i <= k; i++)
if (k % i == 0) m = i, n = k / m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int up = i, down = n + 1 - i, left = j, right = m + 1 - j;
int mn = min({ up, down, left, right });
if (mn == up) a[i][j] = n * m - (n - 2 * mn + 2) * (m - 2 * mn + 2) + j - mn + 1;
else if (mn == right) a[i][j] = n * m - (n - 2 * mn + 1) * (m - 2 * mn + 2) + i - mn;
else if (mn == down) a[i][j] = n * m - (n - 2 * mn + 1) * (m - 2 * mn + 1) + m - j - mn + 1;
else a[i][j] = n * m - (n - 2 * mn) * (m - 2 * mn + 1) + n - i - mn + 1;
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cout << d[a[i][j]] << " \n"[j == m];
}
/*
_____ _ _ _ __ __
| _ \ | | | | | | \ \ / /
| |_| | | | | | | | \ \/ /
| ___/ | | | | _ | | } {
| | | |_| | | |_| | / /\ \
|_| \_____/ \_____/ /_/ \_\
*/
也可以参考下边这篇博客,定义“上下左右”四个步骤来写
坑点:
无