Submission #1283993

#	Time	Username	Problem	Language	Result	Execution time	Memory
1283993		putthi_us	Rice Hub (IOI11_ricehub)	C++20	100 / 100	9 ms	1864 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
  int ans=0;
  vector<long long> qs(R+1,0);
  for(int i=0;i<R;i++){
    qs[i+1]=qs[i]+X[i];
  }
  deque<int> dq;
  for(int i=1;i<=R;i++){
    while(!dq.empty()){
      int mid=(dq.front()+i)/2;
      long long cost=(X[mid-1]*((mid-dq.front())+1))-(qs[mid]-qs[dq.front()-1]);
      cost+=(qs[i]-qs[mid])-(X[mid-1]*(i-mid));
      if(cost>B){
        dq.pop_front();
      }else{
        break;
      }
    }
    dq.push_back(i);
    ans=max(ans,(int) dq.size());
  }
  return ans;
}

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