제출 #307671

#제출 시각아이디문제언어결과실행 시간메모리
307671juggernautRice Hub (IOI11_ricehub)C++14
68 / 100
1092 ms2168 KiB
#include"ricehub.h"
#include<bits/stdc++.h>
using namespace std;
int n,a[100005];
long long b;
bool app(int l,int r){
    long long mn=1e18;
    int i=(l+r)>>1;
    long long cnt=0;
    for(int j=l;j<=r;j++)
        cnt+=abs(a[j]-a[i]);
    mn=min(mn,cnt);
    return mn<=b;
}
bool check(int x){
    bool flag=0;
    for(int i=0;i+x-1<n;i++)flag|=app(i,x+i-1);
    return flag;
}
int besthub(int N,int L,int A[],long long B){
    n=N;b=B;
    for(int i=0;i<n;i++)a[i]=A[i];
    int l=1,r=n,m;
    while(l<r){
        m=(l+r+1)>>1;
        if(check(m))l=m;
        else r=m-1;
    }
    return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...