Program design: l1-49 ladder race, allocation of seats (simulation), Buxiang pill hot

subject
The question : A little .
Ideas : It's numb , I have no brain . Don't wrap , It will be found that it is a matrix assignment problem ,100100 Of , There is only one school in the end .
Time complexity : O(100100)
Code :

#include<bits/stdc++.h>
using namespace std;
const int N = 102;
int n,m,k,T;
int s[N][N];
int a[N],b[N];
int mx = 0;
void solve()
{
    
	cin>>n;
	for(int i=0;i<n;++i) cin>>a[i],a[i]*=10,b[i] = a[i],mx = max(mx,a[i]);
	int cnt = n;
	int now = 1;
	for(int j=0;j<mx;++j)
	{
    
		for(int i=0;i<n;++i)
		{
    
			if(a[i]) 
			{
    
				if(--a[i]==0) cnt--;
				s[i][j] = now++;
				if(cnt==1&&a[i]>0) now++;
			}
		}
	}
	for(int i=0;i<n;++i)
	{
    
		printf("#%d\n",i+1);
		for(int j=1;j<=b[i];++j)
		{
    
			printf("%d",s[i][j-1]);
			if(j%10==0) printf("\n");
			else printf(" ");
		}
	}
}
signed main(void)
{
    
	solve();
	return 0;
}