Parencodings

Parencodings

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: 
q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith right parenthesis in S (P-sequence). 
q By an integer sequence W = w1 w2...wn where for each right parenthesis, say a in S, we associate an integer which is the number of right parentheses counting from the matched left parenthesis of a up to a. (W-sequence). 

Following is an example of the above encodings: 

	S		(((()()())))

	P-sequence	    4 5 6666

	W-sequence	    1 1 1456

Write a program to convert P-sequence of a well-formed string to the W-sequence of the same string. 

Input

The first line of the input contains a single integer t (1 <= t <= 10), the number of test cases, followed by the input data for each test case. The first line of each test case is an integer n (1 <= n <= 20), and the second line is the P-sequence of a well-formed string. It contains n positive integers, separated with blanks, representing the P-sequence.

Output

The output file consists of exactly t lines corresponding to test cases. For each test case, the output line should contain n integers describing the W-sequence of the string corresponding to its given P-sequence.

Sample Input

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

Sample Output

1 1 1 4 5 6
1 1 2 4 5 1 1 3 9

思路: 这题网上有很多解法,其实按照题目要求,将P转换成原列再转换成W就行,不过较麻烦.

对每个右括号编号i = 1,2,3.....,记每2个右括号之间(包括第一个右括号左边)的左括号数为a[i].

从i=1开始,令j=i,如果a[j]>0,则该右括号的左边与前一个右括号右边必定有左括号与之配对,并将a[j]--(表示配对完毕),注意到此时包涵全括号数(即题目所述的W列数)为i-j+1;如果a[j]==0,则查询上一个左括号(j--),直到找到配对的左括号为止.此时包涵全括号数仍为i-j+1.代码如下:

#include <iostream> 
using namespace std;
 
int main()
{
	int case;
	cin >> case;
	while(case--)
	{
		int n,a[100]={0},P[100]={0};
		cin >> n;
		for(int i=1;i<=n;i++)
		{
			cin >> P[i];
			a[i]=P[i]-P[i-1];
		}
		for(int i=1;i<=n;i++)
		{
			int j=i;
			while(a[j]==0 && j>=0)
			{
				j--;
			}
			cout << i-j+1;
			if(i!=n)
				cout << ' ';
			else
				cout << endl;
			a[j]--;
		} 
	}
	return 0;
}