import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] a = new int[n];
for (int i = 0; i <n;i++)
a[i] = input.nextInt();
List<Integer> l = new ArrayList<Integer>();
int length = 1;
for (int i = 0;i<n;i++){
int j;
for (j=i+1;j<n;j++){
if(a[j] > a[j-1]){
length++;
}else{
l.add(length);
length = 1;
break;
}
}
if(j == n){
l.add(length);
break;
}
}
Collections.sort(l);
Collections.reverse(l);
// for(int i : l){
// System.out.println(i);
// }
System.out.println(l.get(0));
input.close();
}
}
最长连续递增序列_java
最新推荐文章于 2021-09-25 15:46:31 发布