제출 #1178264

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1178264		AlgorithmWarrior	Holiday (IOI14_holiday)	C++20	23 / 100	12 ms	1220 KiB

holiday

#include <bits/stdc++.h>
#include "holiday.h"

using namespace std;

void maxself(long long& x,long long val){
    if(x<val)
        x=val;
}

long long int findMaxAttraction(int n, int start, int d, int attraction[]){
    long long ans=0;
    int i,j;
    for(i=start;i>=0;--i){
        priority_queue<int,vector<int>,greater<int>>pq;
        long long sum=0;
        for(j=start-1;j>=i;--j){
            pq.push(attraction[j]);
            sum+=attraction[j];
        }
        for(j=start;j<n;++j){
            pq.push(attraction[j]);
            sum+=attraction[j];
            int drum1=start-i;
            int drum2=j-start;
            int drum=((drum1<=drum2)?2*drum1+drum2:2*drum2+drum1);
            int ramas=d-drum;
            while(pq.size()>ramas){
                sum-=pq.top();
                pq.pop();
            }
            maxself(ans,sum);
        }
    }
    return ans;
}

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