Submission #60998

#TimeUsernameProblemLanguageResultExecution timeMemory
60998nvmdavaRice Hub (IOI11_ricehub)C++17
0 / 100
9 ms656 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; bool price(int X[], int l,int r, long long B){ int i; long long p = 0; int m = (r + l) / 2; for(i = l; i <m ; i++){ p +=(long long)X[m] - X[l]; } for(i = m + 1; i <=r ; i++){ p +=(long long)X[i] - X[m]; } if(p <= B){ return 1; } else { return 0; } } int besthub(int n, int L, int X[], long long B) { int l = 0, r = 0, dif = -1; while(r != n){ if(price(X ,l, r, B)){ dif = max(dif, r - l + 1); r++; } else { l++; } } return dif; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...