This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, d, T;
cin >> n >> d >> T;
vector<int> t(n);
for (int &v : t) {
cin >> v;
}
vector<int> l(n, n);
for (int i = 0; i < n; i++) {
for (int j = i; j >= 0; j--) {
if (j + T - t[j] >= i) {
l[i] = j;
break;
}
}
}
for (int i = 0; i < d; i++) {
pair<int, int> ans = {0, 0};
for (int L = n - 1; L >= 0; L--) {
int cnt = 0;
for (int x = L; x < n; x++) {
if (l[x] < L) {
cnt++;
}
}
ans = max(ans, {cnt, L});
}
for (int x = ans.second; x < n; x++) {
if (l[x] < ans.second) {
l[x] = n;
}
}
}
cout << n - count(l.begin(), l.end(), n) << "\n";
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |