Submission #486026

#TimeUsernameProblemLanguageResultExecution timeMemory
486026Duy_eRabbit Carrot (LMIO19_triusis)C++14
0 / 100
1 ms204 KiB
#include <bits/stdc++.h> #define ll long long #define ull unsigned long long #define pii pair<long long, long long> #define st first #define nd second #define file "test" using namespace std; const long long oo = 1e18; const long long N = 2e5 + 5; ll n, m, a[N], dp[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); // #ifndef ONLINE_JUDGE // freopen(file".inp","r",stdin); freopen(file".out","w",stdout); // #endif cin >> n >> m; for (int i = 1; i <= n; i ++) cin >> a[i]; dp[0] = 1; for (int i = 0; i <= n; i ++){ if (dp[i] != 0) for (int j = i + 1; j <= n; j ++) if (a[i] >= a[j] || a[j] - a[i] <= m) dp[j] = max(dp[j], dp[i] + 1); // cout << dp[i] << ' '; } cout << (dp[n] == 0? n: n - dp[n] + 1); return 0; } /** /\_/\ (= ._.) / >0 \>1 ________________________ / Brainstorming section / /=======================/ --- === === **/ // Before submit: spot the visible bug by reading the code.
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...