Submission #873630

#TimeUsernameProblemLanguageResultExecution timeMemory
873630MisterReaperRabbit Carrot (LMIO19_triusis)C++17
100 / 100
21 ms5316 KiB
//author: Ahmet Alp Orakci #include <bits/stdc++.h> using namespace std; using i64 = long long; #define ONLINE_JUDGE void solve() { int n, m; cin >> n >> m; vector <int> vec(n); for(int &i : vec) cin >> i; vector <int> v; for(int i = 0; i < n; i++) { if(vec[i] <= m * (i +1)) v.emplace_back(m * (i +1) - vec[i]); } vector <int> dp; for(int &i : v) { auto it = upper_bound(dp.begin(), dp.end(), i); if(it == dp.end()) dp.emplace_back(i); else *it = i; } cout << n - int(dp.size()); return; } signed main() { #ifndef ONLINE_JUDGE freopen(".in", "r", stdin); freopen(".out", "w", stdout); #endif ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; //cin >> t; for(int i = 1; i <= t; i++) { solve(); } 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...