제출 #336052

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

ricehub

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

int besthub(int r, int l, int x[], long long b) {
    long long left = 0, right = 0, ans = 0;
    long long curCost = 0;
    while(left < r) {
        if(right >= r)
            break;
        long long OptimalField = (left + right) / 2;
        //cout << left << " " << right << " " << OptimalField << " " << curCost << endl;
        if(curCost + x[right] - x[OptimalField] <= b) {
            curCost += x[right] - x[OptimalField];
            ans = max(ans, right - left + 1);
            right++;
        }
        else {
            curCost -= x[OptimalField] - x[left++];
        }
    }
    return ans;
}
/*
int main() {
    //cout << "Input the number of rice fields" << endl;
    int r;
    cin >> r;
    //cout << "Input the maaimum coordinate" << endl;
    int l;
    cin >> l;
    //cout << "Input r numbers, denoting the rice fields" << endl;
    int a[r];
    for(int i = 0; i < r; i++) {
        cin >> a[i];
    }
    //cout << "Input the budget" << endl;
    int b;
    cin >> b;
    cout << besthub(r, l, a, b) << endl;
}
*/

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