终于更新了(好像已经两年半没更新了)话不多说,上代码!记得复制完看结尾,有惊喜。
#include <bits/stdc++.h>
using namespace std;
int n,d;
long long ans=0;
long long v[100005];
long long a[100005];
long long y[100005];
long long youjia;
main() {
scanf("%d%d",&n,&d);
for (int i=2;i<=n;i++){
scanf("%d",&v[i]);
v[i]+=v[i-1];
y[i]=ceil(1.0*v[i]/d);
}
for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
youjia=a[1];
for (int i=2;i<=n;i++){
ans+=youjia*(y[i]-y[i-1]);
youjia=min(youjia,a[i]);
}
cout<<ans;
return 0;
}