제출 #229542

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

ricehub

#pragma GCC optimize("Ofast")
#include<stdio.h>
#include<algorithm>
using namespace std;
long long pre[100005]={0};
int besthub(int R,int L,int *X,long long B){
	int i,j=-1,ans=0;
	pre[0]=X[0];
	for(i=1;i<R;i++)
		pre[i]=pre[i-1]+X[i];
	for(i=0;i<R;i++){
		while(j+1<R&&pre[j+1]-pre[(j+1+i)/2]-(long long)X[(j+1+i)/2]*(j+1-(j+1+i)/2)+(long long)X[(j+1+i)/2]*((j+1+i)/2-i+1)-pre[(j+1+i)/2]+(i?pre[i-1]:0)<=B)
			j++;
	//	j--;
		//1 1->1 2
		
	//	printf("%d %d %lld\n",i,j,pre[j+1]-pre[(j+1+i)/2]-(long long)X[(j+1+i)/2]*(j+1-(j+1+i)/2)+(long long)X[(j+1+i)/2]*((j+1+i)/2-i+1)-pre[(j+1+i)/2]+(i?pre[i-1]:0));
	//	printf("%lld %lld\n",pre[j+1]-pre[(j+1+i)/2]-(long long)X[(j+1+i)/2]*(j+1-(j+1+i)/2),(long long)X[(j+1+i)/2]*((j+1+i)/2-i+1)-pre[(j+1+i)/2]+(i?pre[i-1]:0));
	//	j++;
	//	printf("%d\n",j-i+1);
		ans=max(ans,j-i+1);
	}	
	return ans;
}

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