| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 19283 | Accepted: 11629 |
Description
S (((()()()))) P-sequence 4 5 6666 W-sequence 1 1 1456
Input
Output
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
水题>>>>>>>>>>
AC代码如下:
#include<iostream>
using namespace std;
int main()
{
int t,n;
int i,j;
int b[30],c[31];
char a[30];
cin>>t;
while(t--)
{
cin>>n;
for(i=1,b[0]=0;i<=n;i++)
{
cin>>b[i];
c[i]=b[i]-b[i-1];
}
int tt=0;
for(i=1;i<=n;i++)//生成匹配括号
{
for(j=1;j<=c[i];j++)
a[tt++]='(';
a[tt++]=')';
}
for(i=0;i<tt;i++)
if(a[i]==')')
b[i]=1;
else b[i]=-1;
int sum,ans;
for(i=0;i<tt;i++)
{
if(b[i]==1)
{
ans=0;sum=0;
for(j=i;j>=0;j--)
{
sum+=b[j];
ans++;
if(sum==0)
{
if(i!=tt-1)
cout<<ans/2<<" ";
else cout<<ans/2;
break;
}
}
}
}
cout<<endl;
}
return 0;
}
POJ 1068 Parencodings,布布扣,bubuko.com
原文地址:http://blog.csdn.net/hanhai768/article/details/37505861