Submission #759214

---

Source Code Expand

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

#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}

const int INF=1001001001001001001ll;

int N;
int A[111111];
int B[111111];

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

    int maxval=-INF;
    int maxB=-INF;
    int cnt=0,val=0;
    rep(i,N+1){
        chmax(maxB,B[i]);
        chmax(maxval,val+(N-cnt)*maxB);

        if(i==N)break;

        int cost=1;
        if(val+A[i]<0){
            if(maxB<=0)break;
            int tmp=(-A[i]-val+maxB-1)/maxB;
            cost+=tmp;
        }
        if(cnt+cost>N)break;
        val+=A[i]+(cost-1)*maxB;
        cnt+=cost;
    }

    cout<<maxval<<endl;

    return 0;
}

Submission Info

Judge Result