2491 - Parencodings

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:

<span style="font-size:12.0000pt;font-family:'宋体';"><br />

S (((()()())))

<span style="font-size:12.0000pt;font-family:'宋体';"><br />

P-sequence 4 5 6666

<span style="font-size:12.0000pt;font-family:'宋体';"><br />

W-sequence 1 1 1456

<span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;<br />

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

C语言解答

#include<stdio.h>
#include<string.h>
int main()
{
    int tcase;
    int n,m;
    int p[21];
    int bf;
    scanf("%d",&tcase);
    for(;tcase--;)
    {
        scanf("%d",&n);
        bf=0;
        memset(p,0,sizeof(p));
        while(n--)
        {
           scanf("%d",&m);
           bf=m;//保存m值
           while(p[m])//元素已经填充
           {
             m-=p[m];
             p[bf]+=p[m];
             //p[m]表示不相交括号的值 p[bf]记录所有和
             //m_pre m_next 相等时，如果p[m-p[m]]==0 即表示 两者左括号相邻
           }
           p[bf]++;
           printf("%d ",p[bf]);

        }
        printf("\n");

    }
    return 0;
}

C++解答

#include<iostream>
#include<string.h>
using namespace std;
int a[101];
int main()
{
    int n,m,bf,x,t;
    cin>>t;
    while(t--)
    {
        cin>>n;
        bf=0;
        memset(a,0,sizeof(a));
        while(n--)
        {
           cin>>m;
           bf=m;
           while(a[m])
           {
             m-=a[m];
             a[bf]+=a[m];
           }
           a[bf]++;
           cout<<a[bf]<<' ';

        }
        cout<<endl;
    }
}

时间限制	1 秒
内存限制	10 MB

讨论统计

上一题下一题