| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1147834 | Luvidi | 휴가 (IOI14_holiday) | C++20 | 5089 ms | 5448 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 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... | ||||
