Submission #1327850

#TimeUsernameProblemLanguageResultExecution timeMemory
1327850arman.khachatryanRice Hub (IOI11_ricehub)C++20
68 / 100
7 ms1408 KiB
#include <bits/stdc++.h>
using namespace std;
long long besthub(int r, int l, int* a, long long b){
    long long pref[r+1];
    pref[0]=0;
    pref[1]=a[0];
    for(int i=2; i<=r; i++){
        pref[i]=pref[i-1]+a[i-1];
    }
    int j=0;
    long long cur, ans=1;
    for(int i=0; i<r; i++){
        int mid=(i+j)/2;
        cur=(mid-j)*a[mid]-(pref[mid]-pref[j]);
        cur+=pref[i+1]-pref[mid+1]-(i-mid)*a[mid];
        if(cur>b){
            j++;
        }else{
            ans=max((i-j+1)*1LL, ans);
        }
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...