PAT 1050.螺旋矩阵(25)

最新推荐文章于 2024-10-05 01:00:00 发布

原创最新推荐文章于 2024-10-05 01:00:00 发布 · 570 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#PAT基础span idtransmar

PAT 专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一个使用C++实现的算法，该算法将一维数组按降序排列后以螺旋状填充到二维数组中。首先读取输入的整数数量和具体数值，然后对这些数值进行排序，接着按照特定的螺旋顺序将它们填入一个矩阵。

#include <stdio.h>  
#include <iostream>  
#include <vector>  
#include <algorithm>  
#include<string>
#include<string.h>
#include<cmath>
using namespace std;

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

int a[100000000], num[10000][10000];

int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	sort(a, a + n, cmd);
	int minm = n, minn = 1;
	for (int i = n; i >= 1; i--)
	{
		if (n%i == 0)
		{
			if (i >= n / i)
			{
				if (i - n / i < minm - minn)
				{
					minm = i;
					minn = n / i;
				}
			}
		}
	}
	int rightz = 0, righty = minn, z = 0, downs = 1, downx = minm, leftz = 0, lefty = minn - 2, upx = minm - 2, ups = 1;
	int right = 0, left = minm - 1, up = 0, down = minn - 1;
	while (z != n)
	{
		for (int i = rightz; i < righty; i++)
		{
			if (z == n) break;
			num[right][i] = a[z++];
		}
		right++; rightz++; righty--;
		for (int i = downs; i < downx; i++)
		{
			if (z == n) break;
			num[i][down] = a[z++];
		}
		down--; downs++; downx--;
		for (int i = lefty; i >= leftz; i--)
		{
			if (z == n) break;
			num[left][i] = a[z++];
		}
		left--; lefty--; leftz++;
		for (int i = upx; i >= ups; i--)
		{
			if (z == n) break;
			num[i][up] = a[z++];
		}
		up++; upx--; ups++;
	}
	for (int i = 0; i < minm; i++)
	{
		for (int j = 0; j < minn; j++)
		{
			cout << num[i][j];
			if (j != minn - 1) cout << " ";
		}
		if (i != minm - 1) cout << endl;
	}
}