# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920893 | cowwycow | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define name "aaaaaa"
void file(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(name".inp", "r")) {
freopen(name".inp", "r", stdin);
freopen(name".out", "w", stdout);
}
}
long long n, c, k;
long long a[100005] = {0};
long long pre[100005];
void solve (){
cin >> n >> c >> k;
pre[0] = 0;
for(long long i = 1; i <= n; i++){
cin >> a[i];
pre[i] += pre[i - 1] + a[i];
}
long long ans = 0;
for(long long i = 1; i <= n; i++){
long long l = i, r = n, mid;
while(l < r){
mid = (l + r + 1) / 2;
long long pos = (i + mid) / 2;
long long cost = a[pos - 1] * (pos - i + 1) - (pre[pos] - pre[i - 1]) + (pre[mid] - pre[pos]) - (mid - pos) * a[pos - 1];
if(cost > k){
r = mid - 1;
}else{
l = mid;
}
}
ans = max(ans, l - i + 1);
}
cout << ans;
}
int main(){
file();
solve();
}