class Solution { public: /** * max increasing subsequence * @param arr int整型vector the array * @return int整型 */ int MLS(vector<int>& arr) { // write code here if (arr.size() == 1) return 1; int k = 1, maxk = k; bool pls; sort(arr.begin(), arr.end()); vector<int>::iterator newit = uni...
