제출 #28926

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

ricehub

#include "ricehub.h"
#include<algorithm>
int besthub(int R, int L, int X[], long long B)
{
    int optimalGain=0;
    int m, l, r;
    l = r = m = 0;
    long long spent = 0;
    int localGain = 1;


        while(1) {
            if(r!=(R-1))r++;
            else break;
            spent+= X[r]-X[m];
            m = (r+l+1)/2;

            if(spent>B) {
                optimalGain = std::max(optimalGain, localGain);

                while(spent>B) {
                    spent+= X[l]-X[m];
                    l++;

                    m = (r+l+1)/2;
                    localGain--;
                }


            }
            localGain++;
        }
                        optimalGain = std::max(optimalGain, localGain);



  return optimalGain ;
}

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