Submission #741121

#TimeUsernameProblemLanguageResultExecution timeMemory
741121josanneo22Rice Hub (IOI11_ricehub)C++17
100 / 100
14 ms3276 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; #define ll long long ll n,m,v,a[100005],sum[100005],ans=-1; bool check(ll l,ll r) { ll mid=(l+r)/2; return ((sum[r]-sum[mid])-(sum[mid-1]-sum[l-1])-a[mid]*((r-l)&1))<=v; } int besthub(int n,int L,int A[], long long B) { v=B; for(int i=1;i<=n;i++) a[i]=A[i-1]; for(ll i=1;i<=n;i++) { sum[i]=sum[i-1]+a[i]; } for(ll l=1,r=0;l<=n;l++) { while(r<n&&check(l,r+1)) r++; ans=max(ans,r-l+1); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...