Submission #207520

#TimeUsernameProblemLanguageResultExecution timeMemory
207520robs쌀 창고 (IOI11_ricehub)C++17
0 / 100
7 ms504 KiB
#include "ricehub.h" #include <bits/stdc++.h> #define debug(args...) //fprintf(stderr, args) typedef long long int lli; using namespace std; const int maxn = 2e5; int s[maxn],cX[maxn],I,J,SUM; int besthub(int R, int L, int X[], long long int B) { s[0] = X[0]; for(int x = 1; x < R; x++) s[x] = s[x-1] + X[x]; int i = 0; int j = 0; lli resp = 0; while(j < R) { int med = (i + j) / 2; lli sumEsq = (X[med] * i) - s[i]; lli sumDir = s[j] - (X[med] * j); lli sum = sumEsq + sumDir; lli r = j - i + 1; debug("%d - %d(%d) %d %d -%d-\n",i,j,sum,sumEsq,sumDir,med); if(sum <= B) { resp = max(resp, r); j++; } else if(i == j) { j++; } else i++; } return resp; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...