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>
#include "ricehub.h"
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
int resp = 0;
for (int i = 1; i <= R; i++)
{
int p = i; int q = i+1;
long long sum = 0; int respi = 0;
while (p >= 1 && q <= R)
{
long long desq = abs(X[i] - X[p]); long long ddir = abs(X[q] - X[i]);
if (desq < ddir)
{
if (sum + desq > B) break;
sum += desq;
p--;
respi++;
}
else
{
if (sum + ddir > B) break;
sum += ddir;
q++;
respi++;
}
}
while (p >= 1)
{
long long desq = abs(X[i] - X[p]);
if (sum + desq > B) break;
sum += desq;
p--;
respi++;
}
while (q <= R)
{
long long ddir = abs(X[q] - X[i]);
if (sum + ddir > B) break;
sum += ddir;
q++;
respi++;
}
// cerr << i << " " << sum << " " << respi << '\n';
resp = max(resp, respi);
}
return resp;
}
# | 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... |