Submission #2213326

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#include <map>
#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> v;
    REP(i,n) {
        int a;
        cin >> a;
        v.push_back(a);
    }
    
    vector<int> dp(n, 1e9);
    for (int w: v) {
        *lower_bound(dp.begin(), dp.end(), w) = w;
    }
    cout << n - (lower_bound(dp.begin(), dp.end(), 1e9) - dp.begin()) << endl;
}

Submission Info

Judge Result