| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 62622 | mhnd | Holiday (IOI14_holiday) | C++14 | 0 ms | 0 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>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 2e5+50;
const ll oo = 1e18;
const ll mod = 1e9+7;
ll f[101],ans;
long long int findMaxAttraction(int n, int start, int d, int a[]){
if(n <= 3000){
multiset<int> q;
ll sum = 0;
for(int i=start;i<n;i++){
ll cur = d-(i-start);
if(!cur)break;
q.insert(a[i]);
sum += a[i];
while(q.size() && q.size() > cur){
sum -= *q.begin();
q.erase(q.begin());
}
ans = max(ans,sum);
}
sum = 0;
q.clear();
for(int i=start;i>=0;i--){
ll cur = d-(start-i);
if(!cur)break;
q.insert(a[i]);
sum += a[i];
while(q.size() && q.size() > cur){
sum -= *q.begin();
q.erase(q.begin());
}
ans = max(ans,sum);
}
for(int i=start;i<n;i++){
sum = 0;
q.clear();
ll cur = d-(i-start);
if(!cur)break;
for(int j=i;j>=0;j--){
if(!cur)break;
q.insert(a[j]);
sum+=a[j];
while(q.size() && q.size() > cur){
sum -= *q.begin();
q.erase(q.begin());
}
cur--;
ans = max(ans,sum);
}
}
for(int i=start;i>=0;i--){
sum = 0;
q.clear();
ll cur = d-(start-i);
if(!cur)break;
for(int j=i;j<n;j++){
if(!cur)break;
q.insert(a[j]);
sum+=a[j];
while(q.size() && q.size() > cur){
sum -= *q.begin();
q.erase(q.begin());
}
cur--;
ans = max(ans,sum);
}
}
return ans;
}
for(int i=0;i<n;i++){
f[a[i]]++;
if(i > d)break;
int k = d - i,cur=0;
for(int j=100;j>=0&&k;j--){
int v = min(k*1ll,f[j]);
k-=v;
cur += j*v;
}
ans = max(ans,cur*1ll);
}
return ans;
}
int x[N];
int main(){
int n,start,d;
cin>>n>>start>>d;
for(int i=0;i<n;i++)cin>>x[i];
cout << findMaxAttraction(n,start,d,x) << endl;
}