Submission #1003338

#	Time	Username	Problem	Language	Result	Execution time	Memory
1003338		vjudge1	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	12 ms	2680 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
ll a[N];
int b;


int besthub(int n, int L, int X[], ll B){  
    ll ans = 0;
    ll pref[N + 1];
    pref[0] = 0;
    for(int i = 0; i < n; ++i)
        pref[i + 1] = pref[i] + X[i];
    
    if(B >= pref[n])
        return n;
    ll l = 1, r = 1;
    while(r <= n)
    {
        ll mid = (l + r) >> 1;
        if(ans == n)
            return n;
        if( ((X[mid - 1] * (mid - l)) - (pref[mid - 1] - pref[l - 1]) + ((pref[r] - pref[mid]) - (X[mid - 1] * (r - mid)))) <= B)
            ans = max(ans,r-l+1);
        
        else
            ++l;
       ++r;
    }
    return ans;
    

}

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32