Submission #535517

---

Source Code Expand

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

#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define int long long
int N;
int A[101010],B[101010];

signed main(){
    cin>>N;
    rep(i,N)cin>>A[i];
    rep(i,N)cin>>B[i];

    int ans=0;
    int ma=0,cur=0,val=0;

    rep(i,N+1){
        if(i!=N)ma=max(ma,B[i]);
        ans=max(ans,(N-cur)*ma+val);
        if(cur==N)break;

        if(val+A[i]>=0)val+=A[i];
        else{
            if(!ma)break;
            int tmp=(abs(val+A[i])+ma-1)/ma;
            cur+=tmp;
            val+=tmp*ma;
        }
        cur++;
        if(cur>N)break;
    }

    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result