POJ 1068 Parencodings 模拟

 

Parencodings

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 13244		Accepted: 7874

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数字串的生成方法是：当前 匹配括号中的右括号 左边有多少个左括号；

         w数字串的生成方法是：当前 匹配的括号中 包含多少个 右括号；

         现 给出P数字串 求出 W数字串

思路：

         用给出的P数字串 还原出 括号匹配串；

         在 还原出的括号串中 生成 W数字串；

1Y。。。。感觉应该可以直接从P串 求出W串 没想出来，就直接模拟了；

#include <iostream>
#include <string>
using namespace std;
int ans[25];
int main()
{
	int t,p,w,i,j,n,r,rr,k;
	scanf("%d", &t);
	while(t--)
	{
		string s;
		int f=0;
		scanf("%d", &n);
		for(i=0; i<n; i++)
		{
			scanf("%d", &p);
			while(f<p)
			{
				f++;
				s += "(";
			}
			s += ")";
			r=rr=1;
			for(k=s.length()-2; k>=0&&rr; k--)
			{
				if(s[k]==')')
				{
					r++; rr++;
				}
				else rr--;
			}
			ans[i]=r;
		}
		for(i=0; i<n; i++)
			printf("%d%c",ans[i],i==n-1?'\n':' ');
	}
	return 0;
}