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"holiday.h"
#include <bits/stdc++.h>
using namespace std;
const int kMax = 107;
int cnt[kMax];
long long findMaxAttraction(int n, int start, int d, int attraction[]){
long long ans = 0;
for(int dist = 0; dist < min(n, d); ++dist){
int rem = d - dist;
long long curr_ans = 0;
++cnt[attraction[dist]];
for(int i = kMax - 1; i >= 0; --i){
if(cnt[i] <= rem){
rem -= cnt[i];
curr_ans += i * cnt[i];
}
else{
curr_ans += i * rem;
break;
}
}
ans = max(ans, curr_ans);
}
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... |