A10526. Maximum Increase
编程题
普及/提高-
知识点
题目描述
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.
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}$ ).
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.
输入输出样例
输入 #1
5 1 7 2 11 15
输出 #1
3
输入 #2
6 100 100 100 100 100 100
输出 #2
1
输入 #3
3 1 2 3
输出 #3
3