제출 #698834

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
698834		finn__	쌀 창고 (IOI11_ricehub)	C++17	0 / 100	3 ms	468 KiB

ricehub

#include "ricehub.h"

#define max(x, y) ((x) > (y) ? (x) : (y))

int besthub(int R, int L, int X[], long long B)
{
    int *mid = X, *begin = X, *end = X, left = 1, right = 0, max_rice = 0;
    long long cost = 0;

    while (mid < X + R)
    {
        // If the cost on the right are too high to restore balance, move the
        // left pointer first.
        if (end != X + R && cost + *end - *mid > B)
            cost -= *mid - *begin, left--;
        while (end != X + R && right <= left && cost + *end - *mid <= B)
            cost += *end - *mid, right++, end++;
        max_rice = max(max_rice, left + right);
        mid++;
    }

    return max_rice;
}

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