const int MAXN=5e5+5;
int h[MAXN],st[MAXN];
int main()
{
	int T=read_int();
	while(T--){
		int n=read_int();
		_for(i,0,n)h[i]=read_int();
		int top=0,ans=0;
		st[top]=0;
		_for(i,1,n){
			while(top){
				int x1=st[top]-st[top-1],x2=i-st[top-1];
				int y1=h[st[top]]-h[st[top-1]],y2=h[i]-h[st[top-1]];
				if(1LL*y2*x1>=1LL*y1*x2)top--;
				else
				break;
			}
			ans=max(ans,i-st[top]);
			st[++top]=i;
		}
		enter(ans);
	}
	return 0;
}