Longest Contiguous Strictly Increasing Subsequence

Given an array of integers, your task is to find the length of the longest contiguous subsequence in which each element is strictly greater than the previous one. In other words, you need to identify the longest segment of the array where the sequence is strictly increasing.

Input Format: The input consists of a single line of space‐separated integers. The first integer n denotes the number of elements in the array, followed by n integers.

Output Format: Output a single integer representing the length of the longest contiguous strictly increasing subsequence.

Example:

For the input: 8 1 2 3 6 7 8 3 2, the longest contiguous strictly increasing subsequence is [1, 2, 3, 6, 7, 8] with length 6.

inputFormat

A single line containing space-separated integers. The first integer denotes the number of elements (n), followed by n integers representing the sequence.

outputFormat

A single integer representing the length of the longest contiguous strictly increasing subsequence.

8 1 2 3 6 7 8 3 2

6