CodeForces 702A Maximum Increase 水

最新推荐文章于 2024-08-31 10:23:18 发布

Katapeltes

最新推荐文章于 2024-08-31 10:23:18 发布

阅读量454

点赞数

CC 4.0 BY-SA版权

分类专栏： acm

本文链接：https://blog.youkuaiyun.com/Katapeltes/article/details/52223158

acm 专栏收录该内容

200 篇文章

订阅专栏

本文介绍了一种解决寻找给定整数数组中最长递增子数组问题的方法。通过遍历数组并比较相邻元素，该算法能高效地找出符合条件的最长递增子数组长度。

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

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