Submission #1003111

#	Time	Username	Problem	Language	Result	Execution time	Memory
1003111		vjudge1	Rice Hub (IOI11_ricehub)	C++17	68 / 100	1027 ms	2136 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
int a[N];
int b;


int besthub(int n, int L, int X[], ll B){  
    int ans = 0, cur = 0, cnt = 0;
    for(int i = 0; i < n; ++i)
        a[i] = X[i];
    for(int i = 0; i < n; ++i)
    {
        int l = i, r = i + 1;
        cur = 0,cnt = 0;
        while(l >= 0 || r < n){
            if((l >= 0 && a[i] - a[l] < a[r] - a[i]) || (r >= n)){
                cur += a[i] - a[l];
                --l;
            }   
            else
            {
                cur += a[r] - a[i];
                ++r;
            }
            if(cur > B)
            {
                break;
            }
            cnt++;
        }
        ans = max(ans,cnt);
    }
    return ans;
}

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