A. Maximum Increasetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard 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.InputThe 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).OutputPrint the maximum length of an increasing subarray of the given array.ExamplesInput51 7 2 11 15Output3Input6100 100 100 100 100 100Output1Input31 2 3Output3
Input51 7 2 11 15
Output3
['dp', 'greedy', 'implementation', '*800']