Submission #996367

#	Time	Username	Problem	Language	Result	Execution time	Memory
996367		hasan2006	Rice Hub (IOI11_ricehub)	C++17	100 / 100	17 ms	3740 KiB

ricehub

#include <bits/stdc++.h>

using namespace std;
#define ll long long

const int N = 1e5 + 9 , mod = 1e9 + 7;
ll a[N] ;


int besthub(int R, int L, int *X, ll B) {
    ll i , l , r , m , x , s , ans = 0;
    for(i = 1; i <= R; i++)
        a[i] = X[i - 1] + a[i - 1];
    for(i = 1; i <= R; i++){
        l = i , r = R;
        while(l != r){
            m = (l + r + 1) / 2;
            x = (m + i) / 2;
            s = (X[x - 1] * (x - i) - (a[x - 1] - a[i - 1])) + (a[m] - a[x] - X[x - 1] * (m - x));
            if(s <= B)  l = m;
            else  r =  m - 1;
        }
        ans = max(ans , r - i + 1);
    }
    return ans;
}
// Author : حسن

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