求调,玄关
  • 板块P1159 排行榜
  • 楼主ZLBh
  • 当前回复0
  • 已保存回复0
  • 发布时间2024/8/20 17:35
  • 上次更新2024/8/20 20:25:36
查看原帖
求调,玄关
1246535
ZLBh楼主2024/8/20 17:35
#include<bits/stdc++.h> 
using namespace std;
struct sings{
	char s[105];
	int bi;
}a[105];
struct sing{
	char ss[105];
	int bb;
}as[105];
int main(){
	int n;
	cin>>n;
	for(int i = 0;i<n;i++){
		char aa[5];
		cin>>a[i].s>>aa[i];
		if(aa[0] == 'U') a[i].bi = 1;
		else if(aa[0] == 'D') a[i].bi = 2;
		else if(aa[0] == 'S'){
			for(int j = 0;j<=sizeof(a[i].s);j++){
				as[i].ss[j] = a[i].s[j]; 
			}
			as[i].bb = 1;
		}
	}
	int zhi = 0,zhi2 = n-1;
	for(int i = 0;i<n;i++){
		if(a[i].bi == 2){
			while(as[zhi].bb == 1){
				zhi++;
			}
			for(int j = 0;j<=sizeof(a[i].s);j++){
				as[zhi].ss[j] = a[zhi].s[j]; 
			}
			zhi++;
		}
		else if(a[i].bi == 1){
			while(as[zhi].bb == 1){
				zhi2--;                                                                             
			}
			for(int j = 0;j<=sizeof(a[i].s);j++){
				as[zhi2].ss[j] = a[zhi2].s[j]; 
			}
			zhi2--;						
		}
	}
	for(int i = 0;i<n;i++){
		for(int j = 0;j<=sizeof(a[i].s);j++){
			cout<<as[zhi2].ss[j]; 
		}
		cout<<endl;
	}
	return 0;
}
2024/8/20 17:35
加载中...