题目地址：传送门
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 ≤ 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.
Sample Input
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<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); }
