Submission #1247494

#TimeUsernameProblemLanguageResultExecution timeMemory
1247494AlmontherRice Hub (IOI11_ricehub)C++20
68 / 100
1096 ms2184 KiB
#include<bits/stdc++.h>

#define ll long long
#define co cout<<

using namespace std;
// stuff

int besthub(int R,int L,int X[],ll B){
    int mx=0;
    ll pref[R+5]={},suff[R+5]={};
    for(int i=1;i<=R;i++) pref[i]=pref[i-1]+X[i-1];
    for(int i=R-1;i>=0;i--) suff[i]=suff[i+1]+X[i];
    for(int i=0;i<R;i++){
        for(int j=R-1;j>=i;j--){
            int mid=(i+j)/2;
            ll sum=X[mid]*(mid-i+1)-(pref[mid+1]-pref[i]);
            sum+=(suff[mid]-suff[j+1])-X[mid]*(j-mid+1);
            if(sum<=B) mx=max(mx,j-i+1);
        }
    }
    return mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...