A1105 Spiral Matrix （25 分）

这个题目自己的想法是螺旋输入mat数组，举例来说，在输入完第一趟外层，停在第二层的起点，然后再循环，虽然结果正确，但是时间长的吓人。。。对算法理解还是不深，不明白为什么和这种停在内层第一个位置的时间复杂度相差的时间这么久

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn = 10010;
int mat[maxn][maxn],a[maxn];
bool cmp(int a, int b) { return a > b; }
int main()
{
	int num;
	scanf("%d", &num);
	for (int i = 0; i < num; i++) { scanf("%d", &a[i]); }
	if (num == 1)
	{
		printf("%d", a[0]);
		return 0;
	}
	sort(a, a + num, cmp);
	int m, n;
	m = (int)ceil(sqrt(1.0*num));
	while (num%m != 0) m++;
	n = num / m;
	int U=1,D=m,L=1,R=n, i = 1, j=1,now = 0;
	while (now<num)
	{
		while (now < num && j < R)
		{
			mat[i][j] = a[now++];
			j++;
	    }
		while (now < num && i < D)
		{
			mat[i][j] = a[now++];
			i++;
		}
		while (now<num && j > L)
		{
			mat[i][j] = a[now++];
			j--;
		}
		while (now<num && i> U)
		{
			mat[i][j] = a[now++];
			i--;
		}
		U++, D--, L++, R--;
		i++, j++;
		if (now == num - 1) mat[i][j] = a[now++];
	}
	for (int i = 1; i <= m; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			printf("%d", mat[i][j]);
			if (j<n) printf(" ");
			else printf("\n");
		}
	}
	return 0;
}