Submission #2214676

---

Source Code Expand

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int inf=1000000000;

int main() {
  int N;
  cin>>N;
  int c[N];
  for (int i=0; i<N; i++) {
    cin>>c[i];
  }
  int dp[N];
  fill(dp,dp+N,inf);
  for (int i=0; i<N; i++) {
    *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