Submission #963129

#TimeUsernameProblemLanguageResultExecution timeMemory
963129AmrRice Hub (IOI11_ricehub)C++17
42 / 100
2 ms604 KiB
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define sz size()
const int N = 1000;
ll pre[N];
int besthub(int R, int L, int X[], long long B)
{
    ll l = 1, r = R+1;
    for(int i = 0; i < R; i++) pre[i+1] = pre[i]+X[i];
    while(l+1<r)
    {
        ll mid = (l+r)/2;
        bool ok = 0;
        for(int i = mid-1; i < R; i++)
        {
            ll po = i-(mid-1)/2;
            ll res = pre[i+1]-pre[po-1+1]-((mid+1)/2)*X[po]+(mid/2)*X[po]-(pre[po-1+1]-pre[i-mid+1]);

            if(res<=B) ok = 1;
        }
        if(ok) l = mid; else r = mid;
    }
  return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...