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;
#define ll long long
const int maxN=1e5+5;
ll sum[maxN+1];
int a[maxN+1];
ll get(ll l,ll r)
{
if(l==0)
{
return sum[r];
}
else return sum[r]-sum[l-1];
}
ll besthub(int L,int n,int a[],ll B)
{
sum[0]=a[0];
for(int i=1;i<n;i++)
{
sum[i]=sum[i-1]+a[i];
}
ll res=0;
for(int len=1;len<=n;len++)
{
ll l=0,r=len-1;
while(r<n)
{
ll cur=a[r]-a[l];
//cout<<l<<" "<<r<<" "<<p<<" "<<cur<<'\n';
if(cur<=B)
{
res=max(res,1LL*len);
}
l++;
r++;
}
}
return res;
}
# | 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... |