Submission #953902

#TimeUsernameProblemLanguageResultExecution timeMemory
9539024QT0RRice Hub (IOI11_ricehub)C++17
49 / 100
10 ms2804 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long ll besthub(int n, int L, int pos[], ll bud){ ll l,p,sm; l=p=sm=0; while(p<n-1 && sm+pos[p+1]-pos[0]<=bud){ p++; sm+=pos[p]-pos[0]; } ll mx=p+1; for (ll i = 1; i<n; i++){ sm+=(ll)(pos[i]-pos[i-1])*(i-l); sm-=(ll)(pos[i]-pos[i-1])*(p-i+1); while(sm>bud && l<i){ sm-=pos[i]-pos[l]; l++; } while(p<n-1 && sm+pos[p+1]-pos[i]<=bud){ p++; sm+=pos[p]-pos[i]; } mx=max(mx,p-l+1); while(l<i && p<n-1 && (pos[p+1]-pos[i])<(pos[i]-pos[l])){ sm-=pos[i]-pos[l]; l++; while(p<n-1 && sm+pos[p+1]-pos[i]<=bud){ p++; sm+=pos[p]-pos[i]; } mx=max(mx,p-l+1); } mx=max(mx,p-l+1); } return mx; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...