摘要：
最长上升子序列 import java.util.*; public class Main { static int[] solution(int[] a, int n) { int[] f = new int[n]; for(int i=0; i < n; i++) { f[i] = 1; for 阅读全文
摘要：
import java.util.*; public class Main { public static void main(String[] args){ Scanner sc = new Scanner(System.in); while(sc.hasNext()){ char[] a = s 阅读全文