제출 #1284419

#제출 시각아이디문제언어결과실행 시간메모리
1284419zxzuamRabbit Carrot (LMIO19_triusis)C++20
0 / 100
2 ms576 KiB
#include <bits/stdc++.h> #define int int64_t using ll = int64_t; using namespace std; constexpr int maxn = 1E5 + 1; void orz() { int n, k; cin >> n >> k; vector <int> a(n + 1); for(int i = 1; i <= n; ++i) cin >> a[i]; vector <int> dp(n + 1, LLONG_MIN); dp[0] = 0; int cur = 1; int last = 0; int cnt = 0; for(int i = 1; i <= n; ++i) { if(cur * k >= a[i] - last) { last = a[i]; cnt++; cur = 1; } } cout << n - cnt; } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); //freopen("promote.in", "r", stdin); //freopen("promote.out", "w", stdout); int T = 1; //cin >> T; while(T--) orz(); 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...