HDU 1361 Parencodings

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=1361
Parencodings

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 877 Accepted Submission(s): 513

Problem Description
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 file 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

题目大意：
给出一组合法的括号中每个右括号前面的左括号的数量
求每队括号中有几对括号（包括自己本身）

思路：
根据当前右括号前的所有左括号与前一个右括号前的所有左括号数量之差等于当前右括号与前一右括号之间的左括号数量还原括号对s
根据括号对内左右括号数量相等来遍历统计括号对数

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
    int t,n;
    while(scanf("%d",&t)!=EOF)
    {
        while(t--)
        {
            int j=0;
            int a[25]={0};//每个右括号前左括号的数量
            int s[50]={0};//还原的原括号对
            int w[25]={0};//所包含的括号对数
            scanf("%d",&n);
            int m=n+1;//所包含的括号对数的下标
            for(int i=1;i<=n;i++)
            {
                scanf("%d",&a[i]);
                int item;
                if((item=a[i]-a[i-1])>0)//左括号为1，右括号为2
                {
                    for(int k=1;k<=item;k++)
                    {
                        j++;
                        s[j]=1;
                    }
                    j++;
                    s[j]=2;
                }
                else
                {
                    j++;
                    s[j]=2;
                }
            }
            /*for(int i=1;i<=n*2;i++)
                cout << s[i] ;*/
            for(int i=n*2;i>0;i--)
            {
                int left=0,right=0;
                if(s[i]==2)
                {
                    for(int k=i;;k--)
                    {
                        if(s[k]==2)
                            right++;
                        if(s[k]==1)
                            left++;
                        if(left==right&&left!=0&&right!=0)
                        {
                            m--;
                            w[m]=right;
                            break;
                        }
                    }
                }
            }
            for(int i=1;i<=n;i++)
            {
                if(i==n)
                    printf("%d\n",w[i]);
                else
                    printf("%d ",w[i]);
            }
        }
    }
    return 0;
}