POJ1068-Parencodings

题目：

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

题意：

给出一种括号序列的表示形式名叫P序列，规则是统计出每个右括号之前的左括号个数作为序列每项的值。然后要求你根据这个求括号列的W序列值，W序列的规则是统计每一个右括号和与其匹配的左括号之间所有匹配后的括号个数。然后输出w序列的个数。

样例解释：

此题多组处理数据，每组输入n个数，每个a[i]代表当前对应的右括号前面共有多少个左括号。
    比如：n=6， 4 5 6 6 6 6 。 对应第一个右括号前有4个左括号，第二个右括号前有5个左括号，不过千万不要落下第一个右括号啊，以此类推下去。。。。。。  
     现在要求输出另一个数组，数组元素为当前右括号包含的括号总数！
   比如：（（）（））
   第一个右括号只包含自己，故为 1；
   第二个右括号也只包含自己， 故为 1；
   第三个右括号包含前面两个括号，再加上自己，故为 3.
   所以应输出：1 1 3 ；

不多扯了，代码比较简短，但是有点儿需要慢慢理解的，直接上代码：

#include <iostream>
#include <cstring>
using namespace std;

int main(){
    int T,a[30];
    cin >> T;
    while(T--){
        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--;
            cout << (i-j) <<' ';
        }
        cout << endl;
    }
    return 0;
}