每日一题 - 240128 - C - Leftover Recipes

• C - Leftover Recipes

---

• TAG - $芝士水题、算法-【枚举】、思维-【固定1维求1维】$
• 时间复杂度 - $O(10^6\ast N)$

//
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 1e6 + 7;
int q[N], a[N], b[N];

void solve() {
	int n;
	scanf("%lld", &n);
	
	int maxq = 0, maxa = 0, maxb = 0;
	for (int i = 1; i <= n; i++) scanf("%lld", &q[i]), maxq = max(maxq, q[i]);
	for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), maxa = max(maxa, a[i]);
	for (int i = 1; i <= n; i++) scanf("%lld", &b[i]), maxb = max(maxb, b[i]);
	
	int ans = 0;
	for (int x = 0; x <= maxq; x++) {
		int y = maxq;
		for (int i = 1; i <= n; i++) {
			if (q[i] - x * a[i] < 0) {
				y = -maxq;
				break;
				
			// 非法除零
			} else if (b[i] != 0) {	
				// x * a[i] <= 1e12
				y = min(y, (q[i] - x * a[i]) / b[i]);
			}
		}
		ans = max(ans, x + y);
	}
	printf("%lld\n", ans);
}

signed main() {
	int t = 1;
//	scanf("%d", &t);
	while (t--) solve();
	return 0;
}

---

实现细节

• `

---

参考示意图

• `

---

参考链接

• C - Leftover Recipes Editorial by evima

---

作者 | 乐意奥AI