제출 #1147834

#제출 시각아이디문제언어결과실행 시간메모리
1147834Luvidi휴가 (IOI14_holiday)C++20
47 / 100
5089 ms5448 KiB
#include"holiday.h"
#include <bits/stdc++.h>
using namespace std;

long long int findMaxAttraction(int n, int s, int d, int a[]) {
    long long ans=0;
    for(int i=s;i>-1&&s-i<=d;i--){
        multiset<long long> c;
        long long sum=0;
        for(int j=i;j<s;j++){
            c.insert(a[j]);
            sum+=a[j];
        }
        while(c.size()+s-i>d){
            sum-=*c.begin();
            c.erase(c.find(*c.begin()));
        }
        for(int j=s;j<n&&min(s-i,j-s)+j-i<=d;j++){
            c.insert(a[j]);
            sum+=a[j];
            while(c.size()+min(s-i,j-s)+j-i>d){
                sum-=*c.begin();
                c.erase(c.find(*c.begin()));
            }
            ans=max(ans,sum);
        }
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...