求助CSP-JT2

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<list>
#include<set>
using namespace std;
const int N=1e5+10;
int n,d,len[N],a[N];
long long sum[N],rest,ans;
signed main(){
	scanf("%d%d",&n,&d);
	for(int i=1;i<n;i++){
		scanf("%d",&len[i]);
		sum[i]=sum[i-1]+len[i];
	}
	a[0]=1e9;
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		a[i]=min(a[i],a[i-1]);
	}
	for(int i=1;i<n;i++){
		int tem;
		cout<<i<<" "<<rest<<" "<<a[i]<<endl;
		if(rest>=sum[i]-sum[i-1]){
			rest-=sum[i]-sum[i-1];
			continue;
		}
		for(int j=i;j<=n&&a[j]==a[i];j++){
			tem=j;
		}
		ans+=((sum[tem]-sum[i-1]-rest-1)/d+1)*a[i];
		rest+=((sum[tem]-sum[i-1]-rest-1)/d+1)*d-(sum[tem]-sum[i-1]);
		i=tem;
	}
	printf("%lld",ans);
}