제출 #799540

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
799540		Liudas	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1084 ms	2444 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int N, int L, int arr[], long long B){
    vector<int> brr;
    for(int i = 0; i < N; i ++){
        brr.push_back(arr[i]);
    }
    int l = 0, r = N + 1;
    while(l + 1 < r){
        int mid = (l + r + 1) / 2;
        int best = 0;
        for(int i = 0; i < N - mid + 1; i ++){
            int t = arr[i + mid / 2], s = 0;
            long long T = B;
            //cout <<"start   " <<  t << " " << T << " " << endl;
            for(int j = i; j < i + mid; j ++){
                //cout <<j <<" " << arr[j] << endl;
                if(T < abs(t - arr[j]))break;
                s++;
                T -= abs(t - arr[j]);
            }
            best = max(best, s);
        }
        //cout <<"ans " << best <<  " " << mid << endl;
        if(best == mid){
            l = mid;
        }
        else{
            r = mid;
        }
    }
    return l;
}

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