Parencodings

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

 

 

#include <iostream>
#include <set>
#include <cstdio>
#include <map>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <queue>
#include <vector>
#include <malloc.h>
using namespace std;
typedef long long ll;
int main(){
    int n;
    cin>>n;
    while(n--){
        int num;
        cin>>num;
        int *arr=(int*)malloc(sizeof(int)*(num+1));
        for(int i=0;i<num;i++){
            cin>>arr[i];
        }
        vector<int> tmp(num+1);//靠近的左边的数量
        vector<int> W(num+1);
        tmp[0]=arr[0];
        for(int i=1;i<num;i++){
                tmp[i]=arr[i]-arr[i-1];
        }

        W[0]=1;
        for(int i=1;i<num;i++){
            W[i]=1;
            if(tmp[i]>0){
                W[i]=1;
                tmp[i]--;
            }else{
                int coun=1;
                int j;
                for(j=i-1;j>=0;j--,coun++){
                    if(tmp[j]>0){
                        break;
                    }
                }
                W[i]+=coun;
                tmp[j]--;
                tmp[i]=0;
            }
        }

        for(int i=0;i<num;i++){
            if(i){
                cout<<" ";
            }
            cout<<W[i];
        }
        cout<<endl;

    }
}