Submission #1019608

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019608		Luvidi	Rice Hub (IOI11_ricehub)	C++17	0 / 100	1090 ms	2652 KiB

ricehub

#include "ricehub.h"

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

int besthub(int n, int L, int X[], long long b)
{
    ll a[n],ans,l=0,r=0,s=0;
    for(int i=0;i<n;i++)a[i]=X[i];
    while(r+1<n&&s+a[r+1]-a[0]<=b){
        r++;
        s+=a[r]-a[0];
    }
    ans=r-l+1;
    for(int i=1;i<n;i++){
        s-=(a[i]-a[i-1])*(r-i+1);
        s+=(a[i]-a[i-1])*(i-l);
        while(r>=i&&a[i]-a[l]>a[r]-a[i]){
            s-=a[i]-a[l];
            l++;
        }
        if(r<i){
            l=r=i;
            s=0;
        }
        while(s>b){
            if(r-1>=i&&(l==i||a[r-1]-a[i]<=a[i]-a[l+1])){
                s-=a[r]-a[i];
                r--;
            }else{
                s-=a[i]-a[l];
                l++;
            }
        }
        while(s<b&&(l||r+1<n)){
            if(r+1<n&&(!l||a[r+1]-a[l]<=a[i]-a[l-1])){
                if(s+a[r+1]-a[i]>b)break;
                r++;
                s+=a[r]-a[i];
            }else{
                if(s+a[i]-a[l-1]>b)break;
                l--;
                s+=a[i]-a[l];
            }
        }
        ans=max(ans,r-l+1);
    }
    return ans;
}

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