POJ 1068 Parencodings

水题一只，你可以用各种方法A它~

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
    int n,a[1000],i,j,f,c,t,T,p;
    while (scanf("%d",&T) != EOF)
    {
        while (T--)
        {
            scanf("%d",&n);
            memset(a,-1,sizeof(a));
            for (i=0; i<n; i++)
            {
                scanf("%d",&t);
                p=0;
                for (j=0; p<t; j++)
                {
                    if (a[j] == -1)
                        p++;
                }
                while (a[j] == 1)
                    j++;
                a[j]=1;
            }

                p=0;
                for (i=0; p<n;i++)
                {
                    f=1;
                    c=0;

                    if (a[i] == 1)
                    {
                        for (j=i-1; j>=0; j--)
                        {
                            if (a[j] == -1)
                            {
                                f--;
                                c++;
                            }
                            else
                                f++;
                            if (f == 0)
                            {
                                printf("%d",c);
                                break;
                            }
                        }

                        if (p != n-1)
                        {
                            printf(" ");
                        }
                        p++;
                    }

                }
                printf("\n");
        }


    }
}