pku acm 1068

//括号匹配问题
#include 
#include 
using namespace std;

int pseq[22];//接收输入p-sequence
int harr[22];//辅助数组，统计pseq[i-1]和pseq[i]之间还有多少个'('没有匹配
int wseq[22];//结果w-sequence
int count;

int main()
{	
	freopen("in.txt","r",stdin);

	int t; // 1 <= t <= 10
	cin>>t;
	while(t--)
	{		
		count = 1;
		pseq[0] = harr[0] = 0;

		int n;// 1 <= n <= 20
		cin>>n;
		while(n--)
		{
			cin>>pseq[count];
			//cout<

测试数据：

4
1
1
2
2 2
6
4 5 6 6 6 6
9
4 6 6 6 6 8 9 9 9