Code 1
Code 1
def solve():
2. n = int(input())
3. a = list(map(int, input().split()))
4. ans = [0] * n
5. cur = 0
6. for i in reversed(range(n)):
7. cur = max(cur, a[i])
8. if cur > 0:
9. ans[i] = 1
10. cur -= 1
11. print(*ans)
12.
13. t = int(input())
14. for _ in range(t):
15. solve()