CodeForces 702A Maximum Increase 水

A. Maximum Increase
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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
3
1 2 3
output
3

//水题 但是咱就是想不出来...

#include<stdio.h>
#include<string>
#include<cstring>
#include<queue>
#include<algorithm>
#include<functional>
#include<vector>
#include<iomanip>
#include<math.h>
#include<iostream>
#include<sstream>
#include<stack>
#include<set>
#include<bitset>
using namespace std;
const int MAX=100005;
int main()
{
    cin.sync_with_stdio(false);
    int n,A[MAX]= {0};
    cin>>n;
    for (int i=1; i<=n; i++)
        cin>>A[i];
    int Ans=0,cnt=1;
    for (int i=2; i<=n; i++)
    {
        if (A[i]>A[i-1])
            cnt++;
        else
        {
            Ans=max(Ans,cnt);
            cnt=1;
        }
    }
    Ans=max(Ans,cnt);
    cout<<Ans<<endl;
    return 0;
}