链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22007#problem/A
G - Parencodings
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
Submit
Status
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
Memory Time Language Length
176 KB 0 ms C++ 1212 B
/*题意给出一个数列表示,每个右括号前面有几个几个左括号
求每个右括号与它的最近匹配的那个左括号要经过几个左括号
方法:简单模拟法:采用首先还原原数列
其次一一查找即可
*/
#include<stdio.h>
#include<string.h>
#include <iostream>
using namespace std;
int main()
{ int p[50];
int s[25],w[25];
int T,n,i,j,k,c;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&s[i]);
memset(p,0,sizeof(p));
memset(w,0,sizeof(w));
k=1;
s[0]=0;
for(i=1;i<=n;i++)
{
for(j=0;j<s[i]-s[i-1];j++)
p[k++]=1;
k++;
}
c=1;
for(i=1;i<k;i++)
if(p[i]==0)
{
for(j=i-1;j>=1;j--)
if(p[j]!=0)
{w[c]++;
if(p[j]==1)
{
p[j]=-1;
c++;
break;
}
}
}
for(i=1;i<c-1;i++)
printf("%d ",w[i]);
printf("%d\n",w[c-1]);
}
return 0;
}