0223——LC刷题开心

#include<iostream>
#include<cstring>
#include<string>
#include<bits/stdc++.h>
using namespace std;
//return the longest increasing sequence
class Solution
{
public:
    int lengthOfLIS(vector<int>& num)
    {
        vector<int> ans;
        for(auto a:num)
        {
            //lower_bound return iterator(迭代器) so use auto simplify
            auto n=lower_bound(ans.begin(),ans.end(),a);
            if(n==ans.end()) ans.push_back(a);
            else *n=a;
        }
        return ans.size();

    }
};
int main()
{
    vector<int> input;
    freopen("a.in","r",stdin);
    int x;
    while(cin>>x)
        input.push_back(x);
    cout<<Solution().lengthOfLIS(input)<<endl;
    return 0;
}