Submission #760454

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1e9;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main(){
	int n;
	cin>>n;
	vi a(n),b(n),c;
	rep(i,n)cin>>a[i];
	rep(i,n)cin>>b[i];
	c=b;
	rep(i,n-1)c[i+1]=max(c[i],c[i+1]);
	int out=n*b[0],t=0,hav=0;
	rep(i,n){
		if(hav+a[t]<0)hav+=b[t];
		else{
			hav+=a[t];
			t++;
			out=max(out,hav+(n-i-1)*c[t]);
		}
	}
	cout<<out<<endl;
}

Submission Info

Judge Result