poj 1068 模拟

//poj 1068
//2013-07-17-08.45
#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;

int a[25];
int lift[25];
int main()
{
    int t, n;
    scanf("%d", &t);
    while (t--)
    {
        scanf("%d", &n);
        for (int i = 1; i <= n; i++)
            scanf("%d", &a[i]);
        lift[1] = a[1]-1;
        printf("1");
        for (int i = 2; i <= n; i++)
        {
            lift[i] = a[i] - a[i-1];
            int cnt = 0;
            for (int j = i; j > 0; j--)
            {
                if (lift[j] == 0)
                    cnt++;
                else
                {
                    lift[j]--;
                    break;
                }
            }
            printf(" %d", cnt+1);
        }
        puts("");
    }
    return 0;
}