好生奇怪，求助

#include<bits/stdc++.h>
using namespace std;
int n;
double c,d2,vol,res;
double dis[8],w[7];
struct node{
	int idx;
	double val;
};
deque<node> q;
bool dfs(int i){
	if(i){
		double dist=dis[i]-dis[i-1];
		while(!q.empty()){
			double temp=min(dist/d2,q.front().val);
			dist-=temp*d2,q.front().val-=temp;
			vol-=temp,res+=temp*w[q.front().idx];
			if(!q.front().val)q.pop_front();
			if(!dist)break;
		}
	}
	if(i==n+1)return true;
	if(c*d2<dis[i+1]-dis[i])return false;
	while(!q.empty()&&w[q.back().idx]>w[i])vol-=q.back().val,q.pop_back();
	q.push_back({i,c-vol}),vol+=c-vol;
	return dfs(i+1);
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	double d1,p;
	cin>>d1>>c>>d2>>p>>n;
	dis[n+1]=d1,w[0]=p;
	for(int i=1;i<=n;i++)cin>>dis[i]>>w[i];
	bool flag=dfs(0);
	if(!flag)cout<<"No Solution";
	else cout<<setprecision(2)<<fixed<<res;
	return 0;
}