제출 #418232

#제출 시각아이디문제언어결과실행 시간메모리
418232Maqsut_03쌀 창고 (IOI11_ricehub)C++14
0 / 100
4 ms332 KiB
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;

int besthub(int R, int L, int X[], long long B)
{
	int ans = 0, m;
	for (int i=0; i<R; i++)
	{
		int sum = 0, b = B, j = i;
		int l = i - 1, r = i + 1;
		while (1)
		{
			if (r < R && l >= 0 && X[i] - X[l] <= X[r] - X[i]) m = X[i] - X[l], l--;
			else if (r < R) m = X[r] - X[i], r++;
			else break;
			if (m > b) break;
			else sum++, b -= m;
		}
		ans = max(ans, sum);
	}
    return R;
} 

컴파일 시 표준 에러 (stderr) 메시지

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:11:23: warning: unused variable 'j' [-Wunused-variable]
   11 |   int sum = 0, b = B, j = i;
      |                       ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...