제출 #16437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
16437		chan492811	쌀 창고 (IOI11_ricehub)	C++98	0 / 100	0 ms	5772 KiB

ricehub

#include "ricehub.h"
#include <algorithm>
using namespace std;
long long n,m,left,right;
long long b,l,max1,now;
long long arr[100010];
int besthub(int R, int L, int X[], long long B)
{
    long long i;
    long long temp;
    n=(long long)R; l=(long long)L; b=B;
    for(i=0;i<n;i++){
        arr[i]=(long long)X[i];
    }
    while(right<n && now<=b){
        now+=arr[right++]-arr[m];
    }max1=max(max1,right-left);
    for(i=1;i<n;i++){
        now+=(i-left)*(arr[i]-arr[i-1]);
        now-=(right-i)*(arr[i]-arr[i-1]);
        while(now>b){
            if((arr[right-1]-arr[i])>(arr[i]-arr[left])){
                now-=arr[right-1]-arr[i]; right--;
            }else{
                now-=arr[left++];
            }
        }while(right<n && now+arr[right]<=b){
            now+=arr[right++];
        }
        max1=max(max1,right-left);
    }
  return (int)max1;
}

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