This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma once
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int besthub(int r, int l, int x[], long long b)
{
int ans=0;
vector<long long> vp;
vp.push_back(-3e15);
for(int i=0;i<r;i++)
vp.push_back(x[i]);
vp.push_back(3e15);
// answer is one of the point in the array pos
for(int i=1;i<=r;i++)
{
int cnt=1;
long long tm=0;
int l=i-1;
int r=i+1;
while(min(vp[i]-vp[l],vp[r]-vp[i])<=(b-tm))
{
tm+=min(vp[i]-vp[l],vp[r]-vp[i]);
if((vp[i]-vp[l])==min(vp[i]-vp[l],vp[r]-vp[i]))
{
cnt++;
l--;
}
else
{
cnt++;
r++;
}
}
ans=max(ans,cnt);
}
return ans;
}
Compilation message (stderr)
ricehub.cpp:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~
# | 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... |