Submission #1335839

---

Source Code Expand

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
typedef long long ll;

long long n, a, b;	ll hp[100001] = { 0 }, h[100001] = { 0 }, coun = 1, ookii = 0, ok = 1000000000, no = 0;

int chec(ll z) {
	for (int i = 0; i < n; i++)
	{
		hp[i] -= b*coun;
		if (hp[i] > 0) {
			ookii += hp[i] / a + !!(hp[i] % a);
			if (ookii > coun) {
				break;
			}
		}
	}
	if (ookii <= coun) {
		ok = coun;
	}
	else {
		no = coun;
	}
	return coun;
}

int main()
{
	cin >> n >> a >> b;
	a = a - b;

	REP(i, n) {
		cin >> h[i];
	}

	while (1) {
		REP(i, 100001) { hp[i] = h[i]; }
		ookii = 0;
		coun = (no + ok) / 2;
		if (ok - no < 2) {
			cout << ok << endl; break;
		}
		chec(coun);
	}
	return 0;
}

Submission Info

Judge Result