Submission #1300167

#TimeUsernameProblemLanguageResultExecution timeMemory
1300167AbdullahIshfaqRabbit Carrot (LMIO19_triusis)C++20
100 / 100
19 ms2524 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define MOD 998244353 void solve() { ll n, t; cin >> n >> t; vector<ll> dp; for (ll i = 1; i <= n; i++) { ll x; cin >> x; ll val = i * t - x; if (val < 0) continue; if (dp.size() == 0) { dp.push_back(val); } else if (val >= dp[dp.size() - 1]){ dp.push_back(val); } else{ *upper_bound(dp.begin(), dp.end(), val) = val; } } cout << n - dp.size(); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll t = 1; // cin >> t; // cout << fixed << setprecision(12); for (ll i = 1; i <= t; i++) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...