# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1254116 | cavid_07 | 쌀 창고 (IOI11_ricehub) | C++20 | 0 ms | 0 KiB |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define db double
#define F first
#define S second
#define ins insert
#define endl '\n'
#define int long long
#define pb push_back
#define pf push_front
int gcd(int a , int b){
return __gcd(a,b);
}
int lcm(int a , int b){
return a/gcd(a,b)*b;
}
int s_num(int n){
int s=0;
while(n>0){
s+=n%10;
n/=10;
}
return s;
}
int p_num(int n){
int p=1;
while(n>0){
p*=(n%10);
n/=10;
}
return p;
}
bool check(int m, int pul, vector<int> vt){
int n=vt.size();
for(int i=0; i<=n-m; i++){
int med=vt[i+m/2];
int ans=0;
for(int j=i; j<min(n,i+m); j++){
ans+=abs(vt[j]-med);
}
if(ans<=pul) return true;
}
return false;
}
void solve(){
int n,r,pul;
cin>>n>>r>>pul;
vector<int> vt(n);
for(int i=0; i<n; i++){
cin>>vt[i];
}
int l=1;
int best=0;
while(l<=r){
int m=(l+r)/2;
if(check(m,pul,vt)){
l=m+1;
best=m;
}
else{
r=m-1;
}
}
cout<<best<<endl;
}
signed main() {
IOS;
int t=1;
//cin>>t;
while(t--){
solve();
}
}