Submission #1348859

#TimeUsernameProblemLanguageResultExecution timeMemory
1348859ramzialoulouFinancial Report (JOI21_financial)C++20
0 / 100
28 ms2632 KiB
#include <bits/stdc++.h>
 
using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, d;
  cin >> n >> d;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<int> best(n + 1, INT_MAX);
  best[0] = 0;
  int ans = 0;
  for (int x : a) {
    int j = upper_bound(best.begin(), best.end(), x) - best.begin();
    ans = max(ans, j);
    best[j] = min(best[j], x);
  }
  cout << ans << '\n';
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...