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.
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).
Print the maximum length of an increasing subarray of the given array.
5
1 7 2 11 15
3
6
100 100 100 100 100 100
1
3
1 2 3
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 }