Maximum Increase
题目描述
A. Maximum Increase
time limit per test
1 secondmemory limit per test
256 megabytesinput
standard inputoutput
standard outputYou 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≤105) − the number of integers.
The second line contains n positive integers a1,a2,...,an (1≤ai≤109).
Output
Print the maximum length of an increasing subarray of the given array.
Examples
Input
5
1 7 2 11 15
Output
3
Input
6
100 100 100 100 100 100
Output
1
Input
3
1 2 3
Output
3
题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 610 题。保留原作者与原赛事署名。