zoj 1016 Parencoding

ZOJ Problem Set - 1016

Parencodings

---

Time Limit: 2 Seconds         Memory Limit: 65536 KB

---

Let S = s1 s2 ... s2n be a well-formed string of parentheses. S can be encoded in two different ways:

• 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).
• 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 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

---

Source: Asia 2001, Tehran (Iran )
源码：



解题报告：
这题的意思先将一种s码转换为括号的形式，然后再将这些左右括号按一定的规则转换为p码，需要理解题意p码的转换过程，只要模拟的去寻找右括号配对左括号时经过的左括号的个数，打印的时候需要注意最后一个不应输出空格，应该搞一个标志，否则就会presentat error。