L1-049 天梯赛座位分配

 

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int a[107],ans[107][107];
vector<int>v;
int main(){
	int n,number=0,max=0;
	cin>>n;
	if(n==0)return 0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		v.push_back(a[i]);
		if(a[i]>max)max=a[i];
	}
	sort(v.begin(),v.end());
	int odd=v[n-1]-v[n-2];
	int last=-1;
	for(int i=1;i<=max*10;i++){
		int len=n;
		for(int j=1;j<=n;j++)
			if(i>a[j]*10)len--;
		for(int j=1;j<=n;j++){
			if(i<=a[j]*10){
				if(j!=last){
					last=j;
					number++;
					ans[j][i]=number;
				}else{
					number+=2;
					ans[j][i]=number;
				}
			}
		}
	}
	for(int i=1;i<=n;i++){
		cout<<"#"<<i<<endl;
		for(int j=1;j<=a[i]*10;j++){
			cout<<ans[i][j];
			if(j%10!=0)cout<<' ';
			else cout<<endl;
		}
	}
}