Submission #914731

#TimeUsernameProblemLanguageResultExecution timeMemory
914731DucNguyen2007Rice Hub (IOI11_ricehub)C++14
0 / 100
1074 ms2652 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long const int maxN=1e5+5; ll sum[maxN+1]; int a[maxN+1]; ll get(ll l,ll r) { return sum[r]-sum[l-1]; } ll besthub(int L,int n,int x[],ll B) { for(int i=0;i<n;i++) { a[i+1]=x[i]; } sum[0]=0; for(int i=1;i<=n;i++) { sum[i]=sum[i-1]+a[i]; } ll res=0; for(int len=1;len<=n;len++) { ll l=1,r=len; while(r<=n) { ll p=(l+r)/2; ll cur=(p-l)*a[p]-get(l,p-1)+get(p+1,r)-(r-p)*a[p]; if(cur<=B) { res=max(res,1LL*len); } l++; r++; } } return res; } /*int main() { int L,n; ll B; cin>>n>>L>>B; for(int i=1;i<=n;i++) { cin>>a[i]; } cout<<besthub(L,n,a,B); }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...