动态规划:最长递增子序列的变形,考试时没写完,考试后10分钟内才发现left<arr[j]写成=的错误,没招了,n>=3输入1,2,3,4,5,6,7,8严格递增返回最长斐波那契子序列长度为5没有返回0 import java.util.*; class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); String a = sc.nextLine(); String[] aa = a.split(","); int len = aa.lengt...