Submission #971765

#TimeUsernameProblemLanguageResultExecution timeMemory
971765batsukh2006Rice Hub (IOI11_ricehub)C++17
100 / 100
11 ms2672 KiB
#include<bits/stdc++.h> #include "ricehub.h" using namespace std; #define ss second #define ff first #define endl '\n' int besthub(int r, int l, int x[], long long b){ int ans=0,m=0; long long cost=0; for(int i=0,j=0; i<r; i++){ cost+=x[i]-x[m]; int mid=(i+j)/2; cost+=(x[mid]-x[m])*(mid-j); cost-=(x[mid]-x[m])*(i-mid+1); m=mid; while(cost>b){ cost-=x[m]-x[j]; int mid=(i+j+1)/2; cost+=(x[mid]-x[m])*(mid-j-1); cost-=(x[mid]-x[m])*(i-mid+1); m=mid; j++; } ans=max(ans,i-j+1); } 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...