Submission #1246807

#TimeUsernameProblemLanguageResultExecution timeMemory
1246807inkvizytorRabbit Carrot (LMIO19_triusis)C++20
100 / 100
17 ms2244 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; vector<int> a (n, 0); for (int i = 0; i < n; i++) { cin >> a[i]; a[i] = (i+1)*m-a[i]; } vector<int> s = {0}; for (int i = 0; i < n; i++) { int y = upper_bound(s.begin(), s.end(), a[i])-s.begin(); if (a[i] < 0) { continue; } if (y==(int)s.size()) { s.push_back(a[i]); } else { s[y] = a[i]; } } cout << n-(s.size()-1) << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...