CodeForces 702A

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

Input

51 7 2 11 15

Output

3

Input

6100 100 100 100 100 100

Output

1

Input

31 2 3

Output

3

这一道题就是给你n个数，然后找出这个序列里边的连续的最大个增序列

#include<iostream>#include<stdio.h>using namespace std;int main(){    int n,a,b,res,result;    while(scanf("%d",&n)!=EOF)    {        res=1;        result=1;        scanf("%d",&a);        for(int i=1; i<n; i++)        {            scanf("%d",&b);            if(b>a)            {                res++;            }            else            {                res=1;            }            a=b;            if(res>result)                result=res;        }        printf("%d\n",result);    }    return 0;}