제출 #382771

#제출 시각아이디문제언어결과실행 시간메모리
382771jjang36524쌀 창고 (IOI11_ricehub)C++14
100 / 100
17 ms2668 KiB
#include "ricehub.h"
#include <algorithm>
long long psum[100100];
int besthub(int R, int L, int X[], long long B)
{
    int i;
    for(i=0;i<R;i++)
    {
        psum[i+1]=psum[i]+X[i];
    }
    int s=0;
    int ans=0;
    for(i=0;i<R;i++)
    {
        while(1)
        {
            long long curcos=0;
            long long m=(s+i)/2;
            curcos+=(m-s+1)*X[m];
            curcos-=psum[m+1]-psum[s];
            curcos-=(i-m)*X[m];
            curcos+=psum[i+1]-psum[m+1];
            if(curcos<=B)
                break;
            s++;
        }
        ans=std::max(ans,i-s+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...