Parencodings
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 19375 | Accepted: 11692 |
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:
Write a program to convert P-sequence of a well-formed string to the W-sequence of the same string.
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-s
equence.
equence.
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 Ps:模拟题 题意: 有一串S 里面都是左括号或又括号 给你一串数字4 5 6 6 6 6 4 代表 在第一个“)”前有4个“(”; 5 代表 在第二个“)”前有5个“(”; 6 代表 在第三个“)”前有6个“(”;6 代表 在第四个“)”前有6个“(”;6 代表 在第五个“)”前有6个“(”;6 代表 在第六个“)”前有6个“(”; 即可模拟出 该括号的序列为“(((()()())))” 要求输出 另一串 数字1 1 1 4 5 6 每个数字 代表 在该括号序列里第一个右括号是跟它前面的第几个左括号相匹配 下面是AC 代码#include<stdio.h> #include<iostream> #include<string.h> #define clr(x) memset(x,0,sizeof(x)); using namespace std; int main() { int Case,ans,n,i,j,t,left,a[200],flag[200]; cin >> Case; while(Case--) { cin >> n; clr(a); clr(flag); int count=left=0; for(i=1; i<=n; i++) { cin >> t; for(int j=left; j<t; j++) a[count++]=1; // 1 代表左括号 2 代表右括号 left=t; a[count++]=2; } int all=count-1,k; for(i=1; i<=n; i++) { for(j=0; j<=all; j++) //从前到后找第一个未匹配的右括号 即 2 if(a[j]==2&&!flag[j]) //flag为标记数组 1为已配对 0为未配对 { flag[j]=1; ans=0; for(k=j; k>=0; k--) { if(a[k]==1) ans++; if(a[k]==1&&!flag[k]) { flag[k]=1; cout <<ans; if(i!=n) cout << " "; else cout << endl; break; } } break; } } } return 0; }