codeforces 702A Maximum Increase

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

风吹过的烟花

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

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM算法_模拟文章标签：模拟

本文链接：https://blog.youkuaiyun.com/zhang__liuchen/article/details/78359260

ACM算法_模拟专栏收录该内容

20 篇文章

订阅专栏

本文介绍了一种求解最大连续上升子序列长度的方法，并提供了一个C++实现示例。通过对输入整数序列的遍历，算法能高效地找出最长递增子序列的长度。

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

点击打开链接

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<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5;
int main()
{
    int a[N+5];
    int n;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
        scanf("%d",&a[i]);
    int ma=0;
    int s=0;
    for(int i=0; i<n-1; i++)
    {
        if(a[i]<a[i+1])
        {
            s++;
            ma=max(ma,s);
        }
        else
            s=0;
    }
    cout<<ma+1<<endl;
    return 0;
}