爆零求解

#include <bits/stdc++.h>
using namespace std;
int n,m,a,b,c,ans,w[100001],e[100001];
int main() {
    cin>>n>>m; 
    for(int i=2;i<=n;i++) {
        cin>>w[i];
        w[i]+=w[i-1];
    }
    for(int i=1;i<=n;i++){
    	cin>>e[i];
	}
	int x=0;
	for(int i=1;i<n;i++){
		int km=0,ww,ii;
		bool k=true;
		for(int j=i+1;j<=n;j++){
			if(e[j]<e[i]){
				km=ceil(1.0*(w[j]-w[i]-x)/m);
				ww=w[j]-w[i]-x;
				k=false;
				//cout<<w[j]<<" "<<w[i]<<" "<<x<<endl;
				ii=j-1;
				//cout<<j<<" "<<km;
				break;
			}
		}
		if(k){
			ans+=ceil(1.0*(w[n]-w[i]-x)/m)*e[i];
			cout<<ans;
			return 0;
		} 
		x+=km*4-ww;
		ans+=km*e[i];
		i=max(i,ii);
		//cout<<x<<endl;
	}
	cout<<ans;
    return 0;
}