POJ 1068 Parencodings (字符串处理)

Parencodings

http://poj.org/problem?id=1068

Time Limit:  1000MS

Memory Limit: 10000K

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

思路见代码：

/*0ms,116KB*/

#include<cstdio>
#include<cstring>

bool right[40];

int main(void)
{
	int t, n, a, temp;
	int i, j;
	int now, count;
	scanf("%d", &t);
	while (t--)
	{
		memset(right, 0, sizeof(right));
		scanf("%d", &n);
		temp = n;
		scanf("%d", &a);
		now = a;
		i = a;
		right[i++] = true;
		while (--temp)
		{
			scanf("%d", &a);
			///构造括号字符串
			if (a == now)
				right[i++] = true;
			else
			{
				i += a - now;
				right[i++] = true;
				now = a;
			}
		}
		for (i = 1; i < (n << 1); ++i)
			if (right[i])
			{
				++i;
				putchar('1');///第一个肯定是1
				break;
			}
		for (; i < (n << 1); ++i)
			if (right[i])
			{
				count = 1;
				for (j = i - 1;; --j)///从右往左数，用count作标记
					if (right[j])
						++count;
					else
					{
						--count;
						if (count == 0)
						{
							printf(" %d", (i - j + 1) >> 1);
							break;
						}
					}
			}
		puts("");
	}
	return 0;
}