Parencodings

Parencodings Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 16511   Accepted: 9874 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 Source Tehran 2001 思路： //模拟题，首先需按照P数列将括号字符串写出来，然后按照规则将S算出。 //应该有更好的答案吧。 #include<iostream> #include<algorithm> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main() { int t,n,i; cin>>t; for(;t>0;t--) { char c[1000]={'\0'}; cin>>n; int *a=new int[n]; for(i=0;i<n;i++) cin>>a[i]; int j,k; j=0; k=0; for(;j<a[0];j++) c[j]='('; c[j]=')'; j++; for(i=1;i<n;i++) { int m; for(m=0;m<a[i]-a[i-1];m++) c[j+m]='('; c[j+m]=')'; j+=m+1; } i=0; for(k=0;k<j;k++) { if(c[k]==')') { c[k]='\0'; int m,c1=0; for(m=k-1;m>=0;m--) if(c[m]=='(') { a[i]=1+(k-m)/2; i++; c[m]='\0'; break; } } } for(i=0;i<n;i++) cout<<a[i]<<' '; cout<<endl; delete []a; } return 0; }