제출 #715571

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715571		cbup	쌀 창고 (IOI11_ricehub)	C++14	0 / 100	3 ms	852 KiB

ricehub

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

long long besthub(int n,int l,int x[],long long b){
    long long cost,ans=1;
    int mid,en,low=0,high=n-1,m,check = 0;
    vector<long long> prefixSum(n+1,0);

    for(int i=1;i<=n;i++)prefixSum[i] = prefixSum[i-1]+x[i-1];
    //for(int i=1;i<=n;i++)cout<<prefixSum[i]<<" "; cout<<endl;
    while(low<=high){
        m = (low+high)/2;
        for(int st=0;st<n;st++){
            en = st+m;
            mid = (st+en)/2;
            cost = (mid-st)*x[mid]*1LL-(prefixSum[mid]-prefixSum[st]) + (prefixSum[en+1]-prefixSum[mid+1])-(en-mid)*x[mid]*1LL;

            if(cost <= b){
                ans = max(ans,en-st+1LL);
                check = 1;
            }
            //cout<<st<<" "<<en<<" "<<cost<<endl;
        }

        if(check)high = m-1;
        else low = m+1;
    }

    return ans;
}

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