Codeforces Educational Codeforces Round 15 A. 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 ≤ 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.

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

 

题目链接: http://codeforces.com/contest/702/problem/A

 

很水的一道题，暴力即可

 1 #include <cstdio>
 2 #include <iostream>
 3 #include <algorithm> 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int n;
 9     cin >> n;
10     int num[n];
11     for(int i = 0; i < n; i++)
12     {
13         cin >> num[i];
14     }
15     int ans = 0, count = 1;
16     for(int i = 1; i < n; i++)
17     {
18         if(num[i] > num[i-1])
19         {
20             count++;
21         }
22         else
23         {
24             ans = max(ans,count);
25             count = 1;
26         }
27     }
28     ans = max(ans,count);
29     cout << ans;
30     return 0;
31 }

显示代码

 

转载于:https://www.cnblogs.com/Mino521/p/5721970.html