Longest Increasing Subarray

Given an array A of N integers, your task is to find the length of the longest strictly increasing contiguous subarray. In other words, determine the maximum length of a subarray (continuous segment) such that every element is strictly greater than the previous one.

Input begins with an integer N, the number of elements, followed by a line containing N space-separated integers. Output a single integer representing the longest increasing contiguous subarray length.

inputFormat

The input consists of two lines:

• The first line contains a single integer N (1 ≤ N ≤ 10^5), the number of elements in the array.
• The second line contains N space-separated integers, representing the array A.

outputFormat

Output a single integer — the length of the longest strictly increasing contiguous subarray.

1
1

1