# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
775638 | danikoynov | Holiday (IOI14_holiday) | C++14 | 5083 ms | 5380 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"holiday.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long int findMaxAttraction(int n, int start, int d, int attraction[])
{
ll ans = 0;
for (int i = 0; i <= start; i ++)
{
multiset < ll > st;
ll sum = 0;
for (int j = i; j < start; j ++)
{
sum = sum + attraction[j];
st.insert(attraction[j]);
}
for (int j = start; j < n; j ++)
{
sum = sum + attraction[j];
st.insert(attraction[j]);
int lf = start - i, rf = j - start;
int left = d - min(lf, rf) * 2 - max(lf, rf);
if (left < 0)
break;
while(st.size() > left)
{
sum = sum - *st.begin();
st.erase(st.begin());
}
if (sum > ans)
ans = sum;
}
}
return ans;
}
Compilation message (stderr)
# | 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... |