///keitherrrr
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair <int, int>
#define vi vector<int>
#define FOR(i, a, b) for (int i=a; i<b; i++)
#define FORd(i, a, b) for (int i=a-1; i>=b; i--)
#define F0R(i, a) for (int i=0; i<a; i++)
#define fi first
#define se second
#define be begin
#define e end
#define lb lower_bound
#define ub upper_bound
#define db long double;
#define mid ((r+l)>>1)
#define tl (id<<1)
#define tr (id<<1|1)
const int N=3e5+5;
const ll inf=1e9;
const int p=998244353;
main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int t; cin >>t; while(t--){
int n; cin>>n;
int m=1,tmp=1;
int a[n+1];
FOR(i,1,n+1){
cin>>a[i];
if(i>1&&a[i]>=m+1){
if(a[i-m]>=m+1) m++;
}
cout<<m<<' ';
}
cout<<'\n';
}
}
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |