제출 #394427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
394427		vishesh312	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1092 ms	3224 KiB

ricehub

#include "bits/stdc++.h"
#include "ricehub.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)(x).size()

using ll = long long;
const int mod = 1e9+7;

int besthub(int r, int l, int x[], ll b) {
    vector<ll> v(x, x+r);
    vector<ll> pre(r+1);
    for (int i = 0; i < r; ++i) pre[i+1] = pre[i] + v[i];
    int ans = 0;
    for (ll st = 0; st < r; ++st) {
        for (ll ed = st; ed < r; ++ed) {
            ll mid = (st + ed) / 2;
            ll cost = (mid - st) * v[mid] - (pre[mid] - pre[st]) + (pre[ed+1] - pre[mid+1]) - (ed - mid) * v[mid];
            if (cost <= b) 
                ans = max((ll)ans, ed-st+1);
        }
    }
    return ans;
}
/*
int main() {
    int r, l, b;
    cin >> r >> l >> b;
    int a[r];
    for (int i =0 ; i < r; ++i) cin >> a[i];
    cout << besthub(r, l, a, b);
}
*/

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