:Parencodings

 

Parencodings

D1075:Parencodings

时间限制:

1000ms

内存限制:

65536kB

描述

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.

输入

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.

输出

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.

样例输入

2
6
4 5 6 6 6 6
9 
4 6 6 6 6 8 9 9 9

样例输出

1 1 1 4 5 6
1 1 2 4 5 1 1 3 9

我是按模拟的方法做的，代码如下：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int a[40], b[40];
int main()
{
    int t, x, m, n, i;
    scanf("%d", &t);
    m = 0;
    while(t--){
        memset(a, -1, sizeof(a)); //赋值为-1
        scanf("%d", &n);
        for(i=0; i<n; i++){
            scanf("%d", &x);
            if(a[x]==-1){
                b[i] = 1;
                a[x] = 0;
            }
            else
            {
                m = 1;
                while(a[x]!=-1){
                    x--;
                    m++;
                }
                b[i] = m;
                a[x] = 0;
            }
        }
        for(i=0; i<n; i++){
            printf("%d ", b[i]);
        }
        printf("\n");
    }
    return 0;
}