제출 #16446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
16446		chan492811	Rice Hub (IOI11_ricehub)	C++98	17 / 100	25 ms	5772 KiB

ricehub

#include "ricehub.h"
#include <cstdlib>
#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){
        if(now+arr[right]-arr[0]<=b)now+=arr[right++]-arr[0];
        else break;
    }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(abs(arr[right-1]-arr[i])>abs(arr[i]-arr[left])){
                now-=abs(arr[right-1]-arr[i]); right--;
            }else{
                now-=abs(arr[i]-arr[left++]);
            }
        }while(now<=b){
            if(left>0 && right<n){
                if(abs(arr[i]-arr[left-1])>abs(arr[right]-arr[i]) && abs(arr[right]-arr[i])<=b-now){
                    now+=abs(arr[right]-arr[i]); right++;
                }else if(abs(arr[i]-arr[left-1])<abs(arr[right]-arr[i]) && abs(arr[i]-arr[left-1])<=b-now){
                    now+=abs(arr[i]-arr[left-1]); left--;
                }else{
                    break;
                }
            }else if(left==0 && right<n){
                if(abs(arr[right]-arr[i])<=b-now){
                    now+=abs(arr[right]-arr[i]); right++;
                }else break;
            }else if(right==n && left!=0){
                if(abs(arr[i]-arr[left-1])<=b-now){
                    now+=abs(arr[i]-arr[left-1]); left--;
                }else break;
            }else break;
        }
        max1=max(max1,right-left);
    }
  return (int)max1;
}

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