Submission #109895

#	Time	Username	Problem	Language	Result	Execution time	Memory
109895		mohammad	Rice Hub (IOI11_ricehub)	C++14	0 / 100	6 ms	512 KiB

ricehub

#include "ricehub.h"
#include "iostream"
#include "vector"
#include "map"
#include "math.h"
#include "string"
#include "algorithm"
#include "set"
#include <iterator>
#include <string.h>
#include <queue>
#include <list>

using namespace	std;

typedef long long ll ;
const ll M = 1e9 + 7 ;
const ll oo = 1e13 ;

int besthub(int R, int L, int X[], long long B){
	int best = 0 , l = 0 , l1 = X[0] ;
	ll co = 0 ;
	for(int i = 0 ; i < R ; ++i){
		if(co + (X[i] - X[(l + i) / 2]) > B){
			best = max(best , i - l + 1);
			l = i ;
		}else{
			co += (X[i]- l1);
		}
		l1 = X[i];
	}
	return best;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32