10181看清楚一共有n+1个点 2dfs里return不能忘记 3看清题意要按照顺序来运送车子 在后面多出的车解决不了前面的燃眉之急

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
const int maxn = 550;
const int inf = 100000000;
int d[maxn];
int G[maxn][maxn],weight[maxn] = {0};
bool vis[maxn] = {false};
int cmax,n,sp,m,minneed = 100000000,minre = 100000000;
vector<int> path,temppath,pre[maxn];
void dijkstra(int s)
{
	fill(d,d+maxn,inf);
	d[s] = 0;
	for(int i = 0; i <= n; i++)
	{
		int u = -1 ,min = inf;
		for(int j = 0; j <= n; j++)
		{
			if(vis[j] == false && d[j] < min)
			{
				u = j;
				min = d[j];
			}
		}
		if(u == -1) return;
		vis[u] = true;
		for(int v = 0; v <= n; v++)
		{
			if(vis[v] == false && G[u][v] != inf)
			{
				if(d[u] + G[u][v] < d[v])
				{
					d[v] = G[u][v] + d[u];
					pre[v].clear();
					pre[v].push_back(u);
				}
				else if(d[u] + G[u][v] == d[v])
				{
					pre[v].push_back(u);
				}
			}
		}
	}
}
void dfs(int v)
{
	if(v == 0)
	{
		temppath.push_back(v);
		int need = 0, remain = 0;
		for(int i = temppath.size()-1; i >= 0; i--)
		{
			int j = weight[temppath[i]];
			if(j > 0)
			{
				//	if(need < j)
					//{
						remain += j;
				//		need = 0;
				//	}
		            //else  need -= j;
			}
			else if(j < 0)
			{
				if(remain >= abs(j))
				{
					remain -= abs(j);
				}
				else 
				{
				    need += abs(j) - remain;//
					remain = 0;
				}
			}
		}
		if(need < minneed)
		{
			minneed = need;
			minre = remain;
			path = temppath;
		}
		else if(need == minneed && remain < minre)
		{
			minre = remain;
			path = temppath;
		}
		temppath.pop_back();
		return;
	}
	
	temppath.push_back(v);
	for(int i = 0; i < pre[v].size(); i++)
	     dfs(pre[v][i]);
	temppath.pop_back();
}
int main()
{
	fill(G[0],G[0]+maxn * maxn,inf);
	int u,v;
	scanf("%d %d %d %d",&cmax, &n, &sp,&m);
	cmax /= 2;
    for(int i = 1; i <= n; i++)	
    {
    	scanf("%d",&weight[i]);
    	weight[i] -= cmax;
    }
	for(int i = 0; i < m; i++)
	{
		scanf("%d %d",&u,&v);
		scanf("%d",&G[u][v]);
		G[v][u] = G[u][v];
	}
	dijkstra(0);
	dfs(sp);
	printf("%d ",minneed);
	for(int i = path.size()-1; i>= 0; i--)
	{
		printf("%d",path[i]);
		if(i != 0) printf("->");
	}
	printf(" %d",minre);
	
	
	
	
	return 0;
}