poj1068（模拟）

http://poj.org/problem?id=1068

#include<stdio.h>
#include<string.h>
int stack[20001],top,b[10001];
void inst(int x,int y)
{
    int i;
    for(i = top+1 ; i <= top+(x-y) ; i++)
    stack[i] = 1;
    top = top+x-y+1;
    stack[i] = 0;
    b[x] = top;
}
int main()
{
    int i,j,k,a[21],t,g,n;
    scanf("%d", &t);
    while(t--)
    {
        top = 0;
        scanf("%d", &n);
        a[0]=0;
        for(i = 1;i <= n ;i++)
        {
            scanf("%d",&a[i]);
            inst(a[i],a[i-1]);
        }
        k = 0;
        for(i = 1 ; i <= n ; i++)
        {
            g = 1;
            for(j = b[a[i]]-1 ; j >= 1; j--)
            {
                
                if(stack[j]==1)
                {
                    stack[j]=2;
                    if(k != 0)
                        printf(" ");
                    printf("%d",g);
                    k++;
                    break;
                }
                else
                    if(stack[j]==2)
                        g++;
            }
        }
        printf("\n");

    }
    return 0;
}