제출 #425250

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
425250		chirathnirodha	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	23 ms	1752 KiB

ricehub

//Coded by Chirath Nirodha
#include<bits/stdc++.h>
#include "ricehub.h"
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define P push
#define I insert
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
const ll mod=1e9+7;

int besthub(int R, int L, int X[], long long B){
  int n=R;
  ll ans=1;
  ll l=0,r=0,cur=0;
  while(l<n && r<n){
    if(cur<=B){
      if(r==n-1)break;
      int m=(l+r+1)/2;
      cur+=(long long) X[r+1]-(long long) X[m];
      r++;
    }
    else{
      if(l==n-1)break;
      int m=(l+r+1)/2;
      cur-=(long long) X[m]-(long long) X[l];
      l++;
    }
    if(cur<=B)ans=max(ans,r-l+1);
  }
  return ans;
}

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