Submission #28846

#TimeUsernameProblemLanguageResultExecution timeMemory
28846kavunRice Hub (IOI11_ricehub)C++14
0 / 100
1000 ms5924 KiB
#include "ricehub.h"
#include <bits/stdc++.h>
#include "ricehub.h"
#include <stdio.h>
#include <stdlib.h>

#define MAX_R  1000000

using namespace std;
typedef long long ll;

int besthub(int R, int L, int X[], long long B)
{
    for(int res = R; res > 0; res--)
    {
        for(int i = 0; i <= R - res; i++)
        {
            int median = (2*i+res-1) / res;
            ll cost = 0;
            for(int j = i; j < i+res; j++)
            {
                cost += abs(X[j] - X[median]);
            }
            if(cost <= B)
                return res;
        }
    }
}

Compilation message (stderr)

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:28:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...