Submission #1247491

#TimeUsernameProblemLanguageResultExecution timeMemory
1247491AlmontherRice Hub (IOI11_ricehub)C++20
42 / 100
1095 ms432 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;
    for(int i=0;i<R;i++){
        for(int j=R-1;j>=i;j--){
            int mid=(i+j)/2;
            ll sum=0;
            for(int idx=i;idx<=j;idx++) sum+=abs(X[idx]-X[mid]);
            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...