最长上升子序列

面试题：最长上升子序列

public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int [] arr=new int[n];
for (int i = 0; i < arr.length; i++) {
arr[i]=sc.nextInt();
}// 6 1 3 4 11 5 7 8 101 102
System.out.println(solution(arr));;
}

public static int solution(int[]arr){
int index=0;
for (int i = 0; i < arr.length-1; i++) {
int in=1;
int p=i;
for (int j = i+1; j < arr.length; j++) {
if(arr[p]<arr[j]){
in++;
p=j;
}else{
if(arr[p+1]<arr[j-1])
p+=2;
}
}index=Math.max(index, in);
}return index;
}