poj 1068 Parencodings

#include <iostream>
#include <stack>
using namespace std;

int main()
{
    int n;
    char Record[20];  // 广义表记录
    stack<char> A;

    cin >> n;
    for ( int i = 0; i < n; ++i )
    {
        int Size, Index = -1;
        int Count1 = 0, Count2;

        cin >> Size;
        for( int j = 0; j < Size; ++j )
        {
            int W = 1, IsMatch = 0;

            cin >> Count2;
            for ( int k = 0; k < Count2 - Count1; ++k )
                A.push(‘(‘);

            while ( IsMatch == 0 )
            {
                if ( A.top() == ‘)‘ )
                {
                    A.pop();
                    W += Record[Index--];
                }
                else
                {
                    A.pop();
                    IsMatch = 1;
                }                
            }

            A.push(‘)‘);
            Record[++Index] = W;
            Count1 = Count2;

            printf("%d ", W );
        }
        printf( "\n" );
    }

    return 0;
}