Submission #4026115

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1e18;
const ll mod = 1e9 + 7;

int main()
{
  int n;
  cin >> n;

  vi c(n);
  rep(i, n) cin >> c[i];

  int dp[n];
  fill(dp, dp+n, inf);
  rep(i, n){
    *lower_bound(dp, dp+n, c[i]) = c[i];
  }

  cout << n-(lower_bound(dp, dp+n, inf)-dp) << endl;

  return 0;
}

Submission Info

Judge Result