제출 #289407

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

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;

#define ll long long
#define endl '\n'
const int N = 1e5 + 5;
int besthub(int r, int l, int x[], ll b){
        ll lf = 1, rt = 1;
        ll cur = 0, ans = 0;
        while (rt < r && (cur + (x[rt] - x[0])) <= b) rt++;
        ans = max(ans, rt - lf + 1);
        for (int i = 2; i <= r; i++){
                cur = cur - (rt - i + 1) * (x[i - 1] - x[i - 2]);
                cur = cur + (i - lf) * (x[i - 1] - x[i - 2]);
                while (cur > b){
                        cur = cur - (x[i - 1] - x[lf - 1]);
                        lf++;
                }
                while (rt < r && (cur + x[rt] - x[i - 1]) <= b){
                        cur = cur + x[rt] - x[i - 1];
                        rt++;
                }
                while (lf > 1 && (cur + x[i - 1] - x[lf - 2]) <= b){
                        cur = cur + x[i - 1] - x[lf - 2];
                        lf--;
                }
                ans = max(ans, rt - lf + 1);
        }
        return ans;
}
/*
ll x[N];
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("time.in", "r")){
                freopen("time.in", "r", stdin);
                freopen("time.out", "w", stdout);
        }
        ll r, l, b;
        cin >> r >> l >> b;
        for (int i = 1; i <= r; i++) cin >> x[i - 1];
        ll lf = 1, rt = 1;
        ll cur = 0, ans = 0;
        while (rt < r && (cur + (x[rt] - x[0])) <= b) rt++;
        ans = max(ans, rt - lf + 1);
        for (int i = 2; i <= r; i++){
                cur = cur - (rt - i + 1) * (x[i - 1] - x[i - 2]);
                cur = cur + (i - lf) * (x[i - 1] - x[i - 2]);
                while (cur > b){
                        cur = cur - (x[i - 1] - x[lf - 1]);
                        lf++;
                }
                while (rt < r && (cur + x[rt] - x[i - 1]) <= b){
                        cur = cur + x[rt] - x[i - 1];
                        rt++;
                }
                while (lf > 1 && (cur + x[i - 1] - x[lf - 2]) <= b){
                        cur = cur + x[i - 1] - x[lf - 2];
                        lf--;
                }
                ans = max(ans, rt - lf + 1);
        }
        cout << ans;
}
/*
*/

컴파일 시 표준 에러 (stderr) 메시지

ricehub.cpp:68:1: warning: "/*" within comment [-Wcomment]
   68 | /*
      |

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