OpenJudge

1068:Parencodings

总时间限制:
1000ms
内存限制:
65536kB
描述
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.
输入
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.
输出
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.
样例输入
2
6
4 5 6 6 6 6
9 
4 6 6 6 6 8 9 9 9
样例输出
1 1 1 4 5 6
1 1 2 4 5 1 1 3 9
来源
Tehran 2001
全局题号
70
添加于
2009-10-29
提交次数
673
尝试人数
356
通过人数
305
您的评价 很水 简单 一般 较难 变态
  • 标签(多个标签用空格分隔):
  • 常用标签:
    递归   动态规划   贪心   搜索   枚举   模拟   数学   字符串处理   几何   高精度计算   图论  

共有3人评分

0.0%
0.0%
33.3%
0.0%
66.7%

已有的标签

字符串处理(1) 数学(1) 模拟(1)