CSP-J T1 T2正解

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

int main(){
	long long n;
	cin>>n;
	long long ans=0,ans1=0;
	bool flag=0;
	long long x=n;
	while(x>0){
		ans++;
		if((x-1)%3==0&&flag==0){
			flag=1;
			ans1=ans;
		}
		x-=(1+(x-1)/3);
	}
	cout<<ans<<' '<<ans1;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
long long ans=0;
int x=0,n,d,v[100005],a[100005],minn[100005],id[100005];
int main(){
	cin>>n>>d;
	for(int i=2;i<=n;i++){
		cin>>v[i];
	}
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	minn[1]=a[1];
	id[1]=1;
	for(int i=2;i<n;i++){
		if(a[i]<minn[i-1]){
			id[i]=i;
		}
		else id[i]=id[i-1];
		minn[i]=min(minn[i-1],a[i]);
	}
	minn[n]=minn[n-1];
	id[n]=id[n-1];
	for(int i=1;i<n;){
		long long sum=0;
		int j;
		for(j=i+1;j<=n&&id[j-1]==id[i];j++){
			sum+=v[j];
		}
		sum-=x;
		x=ceil(1.0*sum/d)*d-sum;
		ans+=(ceil(1.0*sum/d)*minn[i]);
		i=j-1;
	}
	cout<<ans;
	return 0;
}