Submission #741769

#	Time	Username	Problem	Language	Result	Execution time	Memory
741769		Patrick	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	12 ms	2644 KiB

ricehub

#include "ricehub.h"

#include <iostream>
#include <vector>
using namespace std;

using ll = long long;

int besthub(int R, int L, int X[], long long B) {
    vector<ll> ps(R);
    ps[0] = X[0];
    for (int i = 1; i < R; i++) {
        ps[i] = ps[i - 1] + ll(X[i]);
    }
    int en = 0;
    int ans = 0;
    for (int st = 0; st < R; st++) {
        if (en < st) en = st;
        for (; en < R - 1;) {
            int mid = (en + 1 - st) / 2 + st;
            ll lo = ps[mid] - (st == 0 ? 0 : ps[st - 1]);
            ll hi = ps[en + 1] - ps[mid];
            ll cost = (mid - st + 1) * ll(X[mid]) - lo + hi -
                      (en + 1 - mid) * ll(X[mid]);
            // cout << "cost " << st << " " << mid << " " << (en + 1) << " "
            //      << cost << "\n";
            // cout << (mid - st + 1) << " " << (en + 1 - mid) << " " << X[mid]
            //      << "\n";
            if (cost <= B)
                en++;
            else
                break;
        }
        // cout << "ok " << st << " " << en << "\n";
        ans = max(ans, en - st + 1);
    }
    return ans;
}

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