ZOJ--1016：Parencodings

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

题目大意： 意思就是给出该右括号前面有几个左括号，然后找出他对应的左括号是距离他的第几个左括号

思路：定义一个数组存放P码，将右括号所在位置赋值为1，左括号为0，然后从第一个右括号开始，找它对应的左括号，找到之后标记为2.

java AC代码：

import java.util.Scanner;

public class ZOJ_1016 {
	public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		for(int i=0;i<n;i++){
			int m=s.nextInt();
			int arr[]=new int[2*m];
			for(int j=0;j<m;j++)
				arr[s.nextInt()+j]=1;
			int flag=0;
			for(int j=0;j<2*m;j++){
				if(arr[j]!=0){
					flag++;
					int num=1;
					for(int k=j;k>=0;k--){
						if(arr[k]==2)num++;
						if(arr[k]==0){
							arr[k]=2;
							break;
						}
					}
					System.out.print(num);
					if(flag<m)System.out.print(" ");
				}
			}
			System.out.println();
		}
	}
}