Submission #823363

#TimeUsernameProblemLanguageResultExecution timeMemory
82336312345678Rice Hub (IOI11_ricehub)C++17
68 / 100
1080 ms2300 KiB
#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

int besthub(int R, int L, int X[], long long B)
{
  int ans=1;
  vector<ll> qs(R+1), v(R+1);
  for (int i=0; i<R; i++) v[i+1]=X[i], qs[i+1]=qs[i]+v[i+1];
  for (int i=1; i<=R; i++) 
  {
    for (int j=i+1; j<=R; j++)
    {
      int md=(i+j)/2;
      ll ls=v[md]*(md-i+1)-(qs[md]-qs[i-1]);
      ll rs=qs[j]-qs[md]-v[md]*(j-md);
      //cout<<i<<' '<<j<<' '<<ls<<' '<<rs<<'\n';
      if (ls+rs<=B) ans=max(ans, j-i+1);
    }
  }
  return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...