乐逍遥xwl

摘要： Codeforces Round #565 (Div. 3) C. Lose it! You are given an array a consisting of n integers. Each ai is one of the six following numbers: 4,8,15,16,2 阅读全文

摘要： Codeforces Round #565 (Div. 3) B. Merge it! You are given an array aa consisting of nn integers a1,a2,…,an. In one operation you can choose two elemen 阅读全文

摘要： Codeforces Round #565 A. Divide it! You are given an integer n. You can perform any of the following operations with this number an arbitrary (possibl 阅读全文

摘要： Common Subsequence Problem Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a se 阅读全文

摘要： 最长递增长度 题目描述 给定一个长度为n的整数序列S，求这个序列中最长的严格递增子序列的长度。 输入描述: 第一行，一个整数n (2<=n<=50000)，表示序列的长度第二行，有n个整数 (-10^9 <= S[i] <= 10^9)，表示这个序列 输出描述: 输出一个整数，表示最长递增子序列的长 阅读全文