ACM--Maximum Increase--最长递增数组序列

最新推荐文章于 2021-05-22 10:33:11 发布

学霸的一天

最新推荐文章于 2021-05-22 10:33:11 发布

阅读量937

点赞数 1

分类专栏： ACM算法 ACM刷题录文章标签： ACM Maximum Increase 最长递增数组序列

本文链接：https://blog.csdn.net/qq_26891045/article/details/52224164

版权

ACM刷题录同时被 2 个专栏收录

130 篇文章 20 订阅

订阅专栏

ACM算法

120 篇文章 3 订阅

订阅专栏

题目地址：传送门

F - Maximum Increase

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

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.

Sample Input

Input

5
1 7 2 11 15

Output

Input

6
100 100 100 100 100 100

Output

Input

3
1 2 3

Output

#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
    int n,a,b,res=1,result=1;
    scanf("%d",&n);
    scanf("%d",&a);
    for(int i=1;i<n;i++){
        scanf("%d",&b);
        if(b>a){
            res++;
        }else{
            res=1;
        }
        a=b;
        if(res>result)
            result=res;
    }
    printf("%d\n",result);
}