LIS
public class LISEfficient { public static void main(String[] args){ Scanner sc = new Scanner(System.in); int n = sc.nextInt(); //number of elements int[] ar = new int[n]; //input elements for (int i=0; i<n; i++) { ar[i] = sc.nextInt(); } System.out.println(lis2(ar)); //returns the size of LIS } static int lis2(int[] ar){ TreeSet<Integer> set = new TreeSet<Integer>(); for (int i=0; i<ar.length; i++) { Integer ceil = set.ceiling(ar[i]); if(ceil == null) //if ceil not present this simply extends the current sequence set.add(ar[i]); else{ //replace ceil with this value set.remove(ceil); set.add(ar[i]); } } return set.size(); } }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步