Maximum Increase

1000ms

262144K

Description:

You are given array consisting of n integers. Your task is to find the maximum length of an increasing subarray of the given array.

A subarray is the sequence of consecutive elements of the array. Subarray is called increasing if each element of this subarray strictly greater than previous.

Input:

The first line contains single positive integer n (1 ≤ n ≤ 10⁵) — the number of integers.

The second line contains n positive integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹).

Output:

Print the maximum length of an increasing subarray of the given array.

Sample Input:

5
1 7 2 11 15

Sample Output:

Sample Input:

6
100 100 100 100 100 100

Sample Output:

Sample Input:

3
1 2 3

Sample Output:

Informação

Provedor Codeforces

Código CF702A