Submission #1003199

#TimeUsernameProblemLanguageResultExecution timeMemory
1003199ayankarimovaRice Hub (IOI11_ricehub)C++14
0 / 100
537 ms620 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; #define endl '\n' #define ll long long const ll sz=5005; ll a[sz], b[sz], d[sz]; int besthub(int r, int l, int x[], long long k) { for(int i=0; i<r; i++){ for(int j=0; j<i; j++){ d[i]+=x[i]-x[j]; } //cout<<d[i]<<' '; } ll ans=0; for(int i=0; i<r; i++){ for(int j=i; j<r; j++){ ll m=(i+j)/2+1; ll num1=(d[m]-d[i])-i*(x[m]-x[i]); ll num2=(d[j]-d[m])-m*(x[j]-x[m]); if(num1+num2<=k){ ans=max(ans, (ll)j-i+1); //cout<<i<<' '<<j<<' '<<num1<<' '<<num2<<' '<<ans<<endl; } } } return ans; } /* {} [] 5 20 6 1 2 10 12 14 3 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...