CSDN｜每日一练Longest Continuous Increasing Subsequence

Posted 2022-10-05 海轰Pro

目录

• 运行结果
• 题目描述
• 输入描述：
• 输出描述：
• 示例
• 代码
• 结语

运行结果

题目描述

Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).(Test cases are for reference only, you will be scored by the quality of code.)

给定一个未排序的整数数组，求其最长的连续递增子序列(子数组)的长度。(测试用例仅供参考，您将根据代码的质量打分。)

输入描述：

Enter the integer n in the first line. Enter n integers in the second line.

在第一行输入整数n。在第二行中输入n个整数。