POJ-1608-Parencodings

最新推荐文章于 2018-10-10 14:02:14 发布

Stone_____

最新推荐文章于 2018-10-10 14:02:14 发布

阅读量250

点赞数

分类专栏： POJ

本文链接：https://blog.csdn.net/zcy_2016/article/details/52036710

版权

POJ 专栏收录该内容

82 篇文章 0 订阅

订阅专栏

Parencodings

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 24708		Accepted: 14539

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

#include <stdio.h>
#include<string.h>
using namespace std;
int xt[50];
int main()
{
    int n, t ,p[30], w[30];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(xt, 0,sizeof(xt));
        int right = 0, x = 0, left = 0;
        for(int i = 1; i<=n;++i)
        {
            scanf("%d", &p[i]);
            if(p[i]!=left)
            {
                x+=p[i]-left;
                left = p[i];
            }
            xt[++x] =  1;
        }
        int k = 0, kill = 0;
        for(int i = 1; i<=2*n; ++i)
        {
            if(xt[i]==1)
            {
                kill = 1;
                for(int j = i-1; j>=0;j--)
                {
                    if(xt[j]==-1)
                    {
                        kill++;
                    }
                    else if(xt[j]==0)
                    {
                        w[k++] = kill;
                        xt[j] = -1;
                        break;
                    }
                }
            }
        }
        for(int i = 0; i<n; ++i)
            if(i==n-1||n==1)printf("%d\n",w[i]);
        else printf("%d ",w[i]);
    }

    return 0;
}