Longest Increasing Run

You are given T test cases. For each test case, you are given a sequence of N integers. Your task is to calculate the length of the longest consecutive subsequence (run) where each element is strictly greater than the previous one.

In other words, if a sequence is given by \(a_1, a_2, \dots, a_N\), you are to find the maximum \(k\) such that there exists an index \(i\) with \(a_i < a_{i+1} < \dots < a_{i+k-1}\). Note that if the sequence is empty (i.e. \(N=0\)), the answer is defined as 0.

inputFormat

The first line of the input contains an integer T representing the number of test cases.

For each test case, the first line contains an integer N indicating the length of the sequence. The second line contains N space-separated integers representing the sequence.

If N is 0, the second line will be empty.

outputFormat

For each test case, output a single integer on a new line—the length of the longest increasing run in the corresponding sequence.

1
5
1 2 3 4 5

5