제출 #493530

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
493530		Leo121	쌀 창고 (IOI11_ricehub)	C++14	100 / 100	15 ms	1764 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
typedef long long ll;
int besthub(int R, int L, int X[], long long B)
{
  int li = 0, ls = 0, mediana, res = 1, nueva_mediana;
    ll inversion = 0LL;
    while(ls < R - 1){
        ls ++;
        mediana = (li + ls) / 2;
        inversion += ((ll) X[ls] - (ll) X[mediana]);
        if(inversion <= B){
            res = std::max(res, ls - li + 1);
            continue;
        }
        while(inversion > B){
            inversion -= ((ll) X[mediana] - (ll) X[li]);
            nueva_mediana = (li + ls + 1) / 2;
            if(mediana != (li + ls + 1) / 2){
                inversion -= ((ll) X[nueva_mediana] - (ll) X[mediana]);
            }
            li ++;
            mediana = nueva_mediana;
        }
    }
    return res;
}

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