|
||||||||||
ParencodingsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1236 Accepted Submission(s): 740 Problem Description Let S = s1 s2 бн s2n be a well-formed string of parentheses. S can be encoded in two different ways:
Following is an example of the above encodings:
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 file 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
Sample Output
Source | ||||||||||
|