POJ 1068 括号匹配问题

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

题意：对于给出的原括号串，存在两种数字密码串：
1.p序列：当出现匹配括号对时，从该括号对的右括号开始往左数，直到最前面的左 括号数，就是pi的值。
2.w序列：当出现匹配括号对时，包含在该括号对中的所有右括号数（包括该括号 对）,就是wi的值。
对给出的p数字串，求出对应的s串。串长限制均为20。 

这题断断续续看了好几次，终于大块时间把题意看懂了，样例一和样例二

 

 

在其他巨巨的博客看到这个思路，简单清晰，贴出来

#include <iostream>
#include <cstring>
using namespace std;
int main(){
    int N,a[30];
    cin >> N;
    while(N--){
        int n;
        cin >> n;
        a[0] = 0;
        for(int i = 1; i <= n; i++){  //输入的同时输出
            cin >> a[i];
            int j = i - 1;
            while(a[i]-a[j]<i-j) //j<0时 跳出循环
		j--;
            cout << (i-j) <<' ';
        }
        cout << endl;
    }
    return 0;
}