Submission #2359081

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1e9;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for(int i = 0; i < N; ++i){
    cin >> A[i];
    A[i] = i - A[i];
  }
  vector<int> LIS(N,INF);
  for(int i = 0; i < N; ++i){
    *lower_bound(LIS.begin(), LIS.end(), A[i]) = A[i];
  }
  cout << lower_bound(LIS.begin(), LIS.end(), INF) - LIS.begin() << endl;
  return 0;
}

Submission Info

Judge Result