Submission #1220647

#TimeUsernameProblemLanguageResultExecution timeMemory
1220647hmms127쌀 창고 (IOI11_ricehub)C++20
0 / 100
2 ms320 KiB
#include "ricehub.h"

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int besthub (int n, int L, int a[], ll B) {
   int l=0,idx=0,ans=0;
   ll dist=0;
   for(int r=0;r<n;r++){
     int mid=(l+r)/2;
     dist+=(a[r]-a[mid]);
     while(dist>B){
       dist-=(a[mid]-a[l]);
       l++;
     }
     ans=max(ans,r-l+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...