codeforces 702A 水 最长连续上什子序列

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

51 7 2 11 15

output

3

input

6100 100 100 100 100 100

output

1

input

31 2 3

output

3

又是水，注意一下n==1的情况就行了

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);        int n;        int[] a = new int[110000];        while(cin.hasNext()){        n=cin.nextInt();        for(int i=0;i<n;i++){        a[i]=cin.nextInt();        }                if(n==1){        System.out.println(1);            continue;        }        int Max=-1;        int ans=1;        for(int i=1;i<n;i++){        if(a[i]>a[i-1])        ans++;        else        ans=1;                if(Max<ans)        Max=ans;        }     System.out.println(Max);        }}}

/////  日？？？  怎么搞得，排版重叠了？