제출 #259504

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259504		amiratou	Rice Hub (IOI11_ricehub)	C++14	100 / 100	27 ms	1536 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
 
ll cum[100000];
ll sum(int a,int b){
	if(a>b)return 0;
	return cum[b]-(a?cum[a-1]:0);
}
 
int besthub(int R, int L, int X[], long long B)
{
	for (int i = 0; i < R; ++i)
	{
		cum[i]=X[i];
		if(i)cum[i]+=cum[i-1];
	}
	int ans=1;
	for (int i = 0; i < R; ++i)
		for (int j = i+ans; j < R; ++j)
		{
			int idx=i+(j-i)/2;
			int nb_a=idx-i,nb_b=j-idx;
			ll cost=(ll)nb_a*X[idx]-sum(i,idx-1)+sum(idx+1,j)-(ll)nb_b*X[idx];
			if(cost<=B)ans=max(ans,j-i+1);
			else break;
		}
	return ans;
}

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