coderforces 702A Maximum Increase

A. Maximum Increase

time limit per test
1 second

memory limit per test
256 megabytes

input
standard input

output
standard output

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 ≤ 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

31 2 3

output

3
题意：找最长的递增序列中所含的元素的个数

#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int t;
int a[100010];
while(cin >> t)
{
int sum = 1,falg = 1;
cin >> a[0];
for(int i = 1 ; i < t ; i++)
{
cin >> a[i];
if(a[i] > a[i-1])
{
falg++;
if(i == t - 1)
sum = max(sum,falg);
}
else
{
sum = max(sum,falg);
falg = 1;
}
}
cout << sum << endl;
}
return 0;
}