Submission #1070591

#	Time	Username	Problem	Language	Result	Execution time	Memory
1070591		Mardonbekhazratov	Holiday (IOI14_holiday)	C++17	7 / 100	5074 ms	2860 KiB

holiday

#include"holiday.h"
#include<algorithm>
#include<vector>

#define ll long long

using namespace std;

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    if(d==0) return 0LL;
    ll ans=0;
    for(int l=max(0,start-d+1);l<=start;l++){
        vector<int>a;
        for(int r=l;r<n;r++){
            int k=(r-start)+(start-l)+min(r-start,start-l);
            if(k>=d) break;
            a.push_back(attraction[r]);
            if(r>=start){
                sort(a.begin(),a.end());
                ll cur=0;
                for(int i=a.size()-1;i>=max(0,(int)a.size()-(d-k));i--) cur+=a[i];
                ans=max(ans,cur);
            }
        }
    }
    return ans;
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53