Submission #1329084

#	Time	Username	Problem	Language	Result	Execution time	Memory
1329084		hrantsargsyan	쌀 창고 (IOI11_ricehub)	C++20	0 / 100	0 ms	344 KiB

ricehub

#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

long long pref[N];
int n;

int check(int x, long long B)
{
    int l = 1, r = x;
    while (r <= n)
    {
        if ((pref[r] - pref[r - x / 2]) - (pref[l + x / 2 - 1] - pref[l - 1]) <= B)
        {
            return true;
        }
        ++l;
        ++r;
    }
    return false;
}

int besthub(int R, int L, int X[], long long B)
{
    n = R;
    for (int i = 1;i <= n;++i)
    {
        cin >> X[i];
    }
    pref[0] = 0;
    for (int i = 1;i <= n;++i)
    {
        pref[i] = pref[i - 1] + X[i];
    }
    int l = 1, r = n;
    int ans = -1;
    while (l <= r)
    {
        int mid = (l + r) / 2;
        if (check(mid, B))
        {
            ans = max(ans, mid);
            l = mid + 1;
        }
        else
        {
            r = mid - 1;
        }
    }
    return ans;
}

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