23-24C++(OJ题库3273）——局长抓卷王**

代码如下——

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N=1e3+5;
string z[N];
int sc(int n,int i)
{
	if(i>n) return 0;
	int mao=i;
	if(z[mao][0]=='m')
	{
		cout<<"max(";
		mao=sc(n,mao+1);
		cout<<",";
		mao=sc(n,mao+1);
		cout<<")";
		return mao;
	}
	else 
	{
		cout<<z[mao];
		return mao;
	}
}
int main()
{
	int T;
	cin>>T;
	for(int f=1;f<=T;f++)
	{
		int n;
		cin>>n;
		int cao=1;
		int fz=0;
		bool ans=1;
		for(int i=1;i<=n;i++)
		{
			cin>>z[i];
			if(z[i][0]=='m')
			{
				cao+=2;
				fz++;
			}
			else fz++;
			if(fz>cao) ans=0;
			if(fz==cao&&cao!=n) ans=0;
			//cout<<cao<<" - "<<fz<<endl;
		}
		//cout<<cao<<" - "<<fz<<endl;
		if(fz!=cao) ans=0;
		if(fz!=n||cao!=n) ans=0;
		if(ans==1)
		{
			sc(n,1);
			cout<<";"<<endl;
		}
		else cout<<"NO"<<endl;
	}
}

SWE23004别卷了求求你5555555555555555555555555555555

怎么都这么卷啊