Submission #120028

#	Time	Username	Problem	Language	Result	Execution time	Memory
120028		turbat	쌀 창고 (IOI11_ricehub)	C++14	0 / 100	6 ms	640 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define N 100005

long long s[N];

bool can(int l, int r, long long cost){
	int mid = (l + r) / 2;
	return cost >= s[r] - s[mid] - ((r - l) % 2 == 0 ? s[mid + 1] - s[mid] : 0);
}

int besthub(int R, int L, int X[], long long B){
	int ans = 0;
	s[0] = X[0];	
	for (int i = 1;i < R;i++) s[i] = s[i - 1] + X[i];
	for (int i = 0;i < R;i++){
		int l = i, r = R - 1, mid;
		while (l != r){
			mid = (l + r + 1) / 2;
			if (can(l, mid, B)) l = mid;
			else r = mid - 1;
		}
		ans = max(ans, l - i + 1);
	}
  return ans;
}

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