# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
639725 | tabr | Holiday (IOI14_holiday) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
// editorial
long long findMaxAttraction(int n, int s, int d, int a[]) {
function<void(int, int, int, int)> DnC = [&](int, int, int, int) {
};
Dnc(max(0, s - d), s, s, n - 1);
reverse(a, a + n);
s = n - 1 - s;
Dnc(max(0, s - d), s, s, n - 1);
}
#ifdef tabr
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
return 0;
}
#endif