제출 #659221

#제출 시각아이디문제언어결과실행 시간메모리
659221dubabubaRabbit Carrot (LMIO19_triusis)C++14
0 / 100
1 ms296 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, d, ans = 0; cin >> n >> d; int a[n+1]; a[0] = 0; for(int i = 1; i <= n; i++) cin >> a[i]; int dp[n+1]; dp[0] = 0; for(int i = 1; i <= n; i++) { if(a[i] - a[dp[i-1]] <= d) { dp[i] = i; ans++; } else dp[i] = dp[i-1]; } cout << n - ans << '\n'; 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...