POJ 1068 Parencodings

Parencodings

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 29691		Accepted: 17485

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

Source

Tehran 2001

 

 

数据量很小，暴力模拟即可。

思路：现根据p还原s串，再根据s串生成w，方法是考虑每一个')'，从其位置向前扫描，计算与其匹配的左括号这段区间中的右括号数。

#include <cstdio>
#include <string.h>
const int Max = 25;
int p[Max], w[Max], t, n;
char s[Max<<1];

int main()
{
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        for(int i = 0; i < Max; i++)    w[i] = 1;
        p[0] = 0;
        int cnt = 0;
        for(int i = 1; i <= n; i++)     // 生成s串
        {
            scanf("%d", p + i);
            for(int j = 0; j < p[i] - p[i - 1]; j++)    s[cnt++] = '(';
            s[cnt++]=')';
        }
        int index = 0;
        for(int i = 0; i < cnt; i++)
        {
            if(s[i] != ')')    continue;
            int k = 1, j = i - 1;       // k代表当前需要匹配的'('的数目，当为0时说明这个')'找到了匹配的'('
            while(k != 0)
            {
                if(s[j] == ')')
                {
                    w[index]++;
                    k++;
                }
                else    k--;
                j--;
            }
            index++;
        }
        printf("%d", w[0]);
        for(int i = 1; i < index; i++)    printf(" %d", w[i]);
        putchar('\n');
    }
    return 0;
}