# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
730940 | rainboy | Mountain Trek Route (IZhO12_route) | C11 | 155 ms | 21648 KiB |
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 <stdio.h>
#define N 1000000
int min(int a, int b) { return a < b ? a : b; }
int main() {
static int aa[N], ii[N], dd[N];
static long long cc[N + 1];
int n, k, cnt, i, i_, d, ans;
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
i_ = -1;
for (i = 0; i < n; i++)
if (i_ == -1 || aa[i_] < aa[i])
i_ = i;
cnt = 0;
for (i = 0; i < n; i++) {
d = aa[(i_ + i) % n] - aa[(i_ + i + 1) % n];
if (d > 0)
ii[cnt] = i, dd[cnt] = d, cnt++;
else {
d = -d;
while (cnt)
if (d >= dd[cnt - 1])
cc[i - ii[cnt - 1]] += dd[cnt - 1], d -= dd[cnt - 1], cnt--;
else {
cc[i - ii[cnt - 1]] += d, dd[cnt - 1] -= d;
break;
}
}
}
ans = 0;
for (d = 1; d < n; d++)
if (k / d >= cc[d])
k -= cc[d] * d, ans += cc[d];
else {
ans += k / d;
break;
}
ans *= 2;
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |