# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1260505 | wedonttalkanymore | Telefoni (COCI17_telefoni) | C++20 | 62 ms | 4936 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define pii pair<ll, ll>
#define fi first
#define se second
const ll N = 3e5 + 5, inf = 1e18, mod = 1e9 + 7, block = 320, lim = 16;
int n, d;
int a[N], dp[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
if (fopen(".inp", "r")) {
freopen(".inp", "r", stdin);
freopen(".out", "w", stdout);
}
cin >> n >> d;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) dp[i] = inf;
dp[0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = max(0LL, i - d); j < i; j++) {
dp[i] = min(dp[i], dp[j] + (a[i] == 0));
}
}
cout << dp[n];
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |