Submission #17462

#TimeUsernameProblemLanguageResultExecution timeMemory
17462kdh9949Rice Hub (IOI11_ricehub)C++98
100 / 100
25 ms4988 KiB
#include "ricehub.h"
 
#define MAX(a,b) ((a) > (b) ? (a) : (b))
 
int besthub(int R, int L, int X[], long long B)
{
    int maxn = 1;
    int j = 0;
    long long cursum = 0;
    for(int i = 0; i < R; i++){
        for(j++; j < R; j++){
            if(cursum + (long long)(X[j] - X[(i + j) / 2]) > B){
              j--;
              break;
            }
            cursum += (long long)(X[j] - X[(i + j) / 2]);
        }
        if(j >= R)j = R - 1;
        maxn = MAX(maxn, j - i + 1);
        cursum -= (long long)(X[(i + j + 1) / 2] - X[i]);
    }
    return maxn;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...