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

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

原创最新推荐文章于 2021-05-22 10:33:11 发布 · 969 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

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

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

130 篇文章

订阅专栏

ACM算法

120 篇文章

订阅专栏

本文介绍了一道关于寻找给定整数数组中最长递增子数组的问题，并提供了一个简单的解决方案。通过一次遍历的方式，该算法能有效地找到符合条件的最长子数组长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目地址：传送门

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);
}