Submission #2406742

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

long long n, a[100009], b[100009], maxn = -(1LL << 60);

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) cin >> b[i];
	maxn = max(maxn, b[1] * n);

	long long kane = 0, days = 0, rev = b[1];
	for (int i = 1; i <= n; i++) {
		kane += a[i]; days++; while (days <= n && kane < 0) { kane += rev; days++; }
		if (days > n) {
			break;
		}
		rev = max(rev, b[i + 1]);
		maxn = max(maxn, kane + rev * (n - days));
	}
	cout << maxn << endl;
	return 0;
}

Submission Info

Judge Result