제출 #296629

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
296629		alexandra_udristoiu	Rice Hub (IOI11_ricehub)	C++14	0 / 100	5 ms	768 KiB

ricehub

#include "ricehub.h"
#include<algorithm>
#define DIM 100005
using namespace std;

static int v[DIM], n;
static long long sum[DIM];
long long calc(int p, int u, int i){
    return v[i] * 1LL * (u - p + 1) + (sum[u] - sum[i]) - (sum[i] - sum[p - 1]);
}
long long solve(int k){
    int i, p;
    long long minim = 100000000000000LL;
    p = 1;
    for(i = 1; i <= n - k + 1; i++){
        p = max(p, i);
        while(p < i + k - 1 && calc(i, i + k - 1, p + 1) <= calc(i, i + k - 1, p) ){
            p++;
        }
        minim = min(minim, calc(i, i + k - 1, p) );
    }
    return minim;
}

int besthub(int N, int m, int X[], long long b){
    int i, st, dr, mid;
    n = N;
    for(i = 1; i <= n; i++){
        v[i] = X[i - 1];
        sum[i] = sum[i - 1] + v[i];
    }
    st = 1;
    dr = n;
    while(st <= dr){
        mid = (st + dr) / 2;
        if( solve(mid) <= b ){
            st = mid + 1;
        }
        else{
            dr = mid - 1;
        }
    }
    return dr;
}

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