# poj1068——Parencodings

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

p序列是指：对于第i个右括号，p[i]就是这个右括号左边的左括号数量。
w序列是指：对于第i个右括号，w[i]指向左经过多少个已匹配的左括号，找到一个未匹配的左括号

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdio>
//#include <set>
#include <vector>
#include <iomanip>
#include <stack>
#include <map>
#include <queue>
#define MAXN 1010
#define mod 2012
#define INF 0x3f3f3f3f
using namespace std;
char s[MAXN];
int p[MAXN],w[MAXN],vis[MAXN];
int main()
{
ios::sync_with_stdio(false);
int t,n,i,j;
cin>>t;
while(t--)
{
memset(vis,0,sizeof(vis));
cin>>n;
for(i=0; i<n; ++i)
cin>>p[i];
int tmp=0;
for(i=0,j=0; i<n; ++i)
{
tmp=p[i]-tmp;
while(tmp--)
s[j++]='(';
s[j++]=')';
tmp=p[i];
}
s[j]='\0';
int len=j,k=0;
for(i=0; i<len; ++i)
{
if(s[i]==')')
{
j=i-1;
int sum=1;
while(1)
{
if(s[j]=='('&&!vis[j])
{
vis[j]=1;
break;
}
if(s[j]=='(')
sum++;
j--;
}
w[k++]=sum;
}
}
w[k]='\0';
cout<<w[0];
for(i=1; i<k; ++i)
cout<<" "<<w[i];
cout<<endl;
}
return 0;
}


07-14 2090

10-13 409

09-28 85

08-09 497

04-19 128

09-03 112

12-09 313

07-22 173

03-22 396

05-15 115