fjnu 1031 Parencodings

最新推荐文章于 2021-02-17 20:49:27 发布

核动力蜗牛Killua

最新推荐文章于 2021-02-17 20:49:27 发布

阅读量720

点赞数

分类专栏： ☆ACM 解题报告☆ 文章标签： integer output each string input file

本文链接：https://blog.csdn.net/killua_hzl/article/details/2312783

版权

☆ACM 解题报告☆ 专栏收录该内容

229 篇文章 6 订阅

订阅专栏

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:

#include
   
   <
   
   iostream
   
   >
   
   

   
   using
   
    
   
   namespace
   
    std;


   
   int
   
    n;

   
   int
   
    a[
   
   100
   
   ];

   
   int
   
    b[
   
   100
   
   ];

   
   char
   
    s[
   
   100
   
   ];

   
   int
   
    flag[
   
   100
   
   ];


   
   void
   
    input()

   
   ...
   
   {
    int i,j,k=0;
    for(i=1;i<=n;i++)
        cin>>a[i];
    for(i=1;i<=n;i++)
    ...{
        for(j=1;j<=a[i]-a[i-1];j++)
            s[k++]='(';
        s[k++]=')';
    }
    s[k]='