Maximum Increase

## 题目大意 给出一个长度为 $n$ 的序列，求出最长上升子串的长度。 ## 输入格式 第一行一个正整数 $n$ ，表示序列长度。 接下来一行 $n$ 个正整数，表示给定的序列。 ## 输出格式 一行一个正整数，表示最长上升子串的长度。

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.

The first line contains single positive integer $ n $ ( $ 1<=n<=10^{5} $ ) — the number of integers. The second line contains $ n $ positive integers $ a_{1},a_{2},...,a_{n} $ ( $ 1<=a_{i}<=10^{9} $ ).

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

5
1 7 2 11 15

3

6
100 100 100 100 100 100

1

3
1 2 3

3