Submission #1268647

#	Time	Username	Problem	Language	Result	Execution time	Memory
1268647		nerrrmin	쌀 창고 (IOI11_ricehub)	C++20	42 / 100	1095 ms	440 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5+10;
long long n, l;
long long a[maxn];

int besthub(int R, int L, int X[], long long B)
{
    n = R;
    l = L;
    for (int i = 1; i <= n; ++ i)
    {
        a[i] = X[i-1];
    }
    int best = 0;
    for (int i = 1; i <= n; ++ i)
    {
        for (int j = i; j <= n; ++ j)
        {
            int sz = j - i + 1;
            int median = (j + i)/2;
            int pos = a[median];
            long long cost = 0;
            for (int k = i; k <= j; ++ k)
            {
                cost += abs(a[k] - pos);
            }
            if(cost <= B)best = max(best, sz);
            if(sz % 2 == 1)continue;
            median ++;
            pos = a[median];
            cost= 0;
            for (int k = i; k <= j; ++ k)
            {
                cost += abs(a[k] - pos);
            }
            if(cost <= B)best = max(best, sz);
        }
    }
  return best;
}

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