Submission #1275894

---

Source Code Expand

#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"


int main() {
	int N; cin >> N;
	vector<long long int>as, bs;
	for (int i = 0; i < N; ++i) {
		int A; cin >> A;
		as.push_back(A);
	}
	for (int i = 0; i < N; ++i) {
		int B; cin >> B;
		bs.push_back(B);
	}
	long long int ans = 0;
	long long int rest = N;
	long long int money = 0;
	long long int maxstay = 0;
	for (int i = 0; i < N; ++i) {
		if (rest <= 0)break;
		maxstay = max(maxstay, bs[i]);
		ans = max(ans, money+maxstay * rest);
		if (money + as[i] >= 0) {
			rest--;
			money += as[i];
		}
		else {
			long long int need = -money - as[i];
			if (maxstay == 0)break;
			else {
				long long int needday = (need - 1) / maxstay+1;
				if (needday > rest - 1) {
					break;
				}
				else if (needday == rest - 1) {

					rest -= needday + 1;
					money = money + as[i] + maxstay*needday;
				}
				else {

					rest -= needday + 1;
					money = money + as[i] + maxstay*needday;
				}
			}
		}
	}
	cout << ans << endl;

	/*int T; cin >> T;
	while (T--) {
		int N; cin >> N;
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < N; ++j) {

			}
		}
	}*/
	return 0;
}

Submission Info

Judge Result