# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701907 | PCTprobability | Holiday (IOI14_holiday) | C++17 | 10 ms | 1236 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>
#include "holiday.h"
using namespace std;
using ll = long long;
ll findMaxAttraction(int n,int start,int d,int attraction[]){
ll ans=0;
assert(n<=20);
for(int i=start;i>=0;i--){
for(int j=start;j<n;j++){
int ca=d-(start-i)-(j-start)-min(start-i,j-start);
if(ca<0) continue;
vector<int> a;
for(int l=i;l<=j;l++) a.push_back(attraction[l]);
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
ll now=0;
for(int l=0;l<ca&&l<a.size();l++) now+=a[l];
ans=max(ans,now);
}
}
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... |