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 "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int besthub(int R, int L, int X[], long long B)
{
int ans=1;
vector<ll> qs(R+1), v(R+1);
for (int i=0; i<R; i++) v[i+1]=X[i], qs[i+1]=qs[i]+v[i+1];
for (int i=1; i<=R; i++)
{
for (int j=i+1; j<=R; j++)
{
int md=(i+j)/2;
ll ls=v[md]*(md-i+1)-(qs[md]-qs[i-1]);
ll rs=qs[j]-qs[md]-v[md]*(j-md);
//cout<<i<<' '<<j<<' '<<ls<<' '<<rs<<'\n';
if (ls+rs<=B) ans=max(ans, j-i+1);
}
}
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... |