大臣的旅程(蓝桥杯c/c++)_c++ 大臣的旅费-CSDN博客

本文链接：https://blog.csdn.net/qq_75162132/article/details/136769424

本文介绍了三种解决旅行费用问题的C++代码实现，分别使用邻接矩阵和邻接表存储方式，以及通过两次DFS找到最远点的方法。着重讨论了空间效率和时间复杂度优化。

摘要由CSDN通过智能技术生成

题目描述：

解法一：

用邻接矩阵存储各地点的状态，然后dfs求出结果

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

bool vis[10010];
int w[10010][10010];
int n;
int sum = 0,MAX = 0;

void dfs(int s){
	for(int i=1;i<=n;i++){
		if(!vis[i]&&w[s][i]>0){
			vis[i] = true;
			sum+=w[s][i];
			dfs(i);
			vis[i] = false;
			sum-=w[s][i];
		}
	}	
	if(sum>MAX){
		MAX=sum;
	}
}

int main(){
	cin>>n;
	for(int i = 1;i<=n-1;i++){
		int a,b,c;
		cin>>a>>b>>c;
		w[a][b] = c;
		w[b][a] = c;
	}
	
	for(int i=1;i<=n;i++){
		vis[i] = true;
		dfs(i);
		vis[i] = false;
	}
	cout<<MAX*10+(MAX+1)*MAX/2;
	return 0; 
}

该方法存储空间不足

解法二：

用邻接表存储，在进行dfs

#include<cstring>
#include<algorithm>
#include<iostream>

int n;
typedef struct Node{
	int data;
	int dist;
	struct Node* next;
}Node,*node;
node w[100010];
bool vis[100010];
int MAX=0,sum =0;

void dfs(int s){
	node p = w[s]->next;
	while(p){
		if(!vis[p->data]){
			vis[p->data] = true;
			sum+=p->dist;
			dfs(p->data);
			sum-=p->dist;
			vis[p->data] = false;
		}
		p = p->next;
	} 
	if(MAX<sum){
		MAX = sum;
	}
}
void Add(int a,int b,int c){
	if(w[a]==NULL){
		w[a] = (node)malloc(sizeof (Node));
		w[a]->next = NULL;
	}
	if(w[b] == NULL){
		w[b] = (node)malloc(sizeof (Node));
		w[b]->next = NULL;
	}
	    node p1 = (node)malloc(sizeof (Node));
		p1->data = b;
		p1->dist = c;
		p1->next = w[a]->next;
		w[a]->next = p1;
		node p2 = (node)malloc(sizeof (Node));
		p2->data = a;
		p2->dist = c;
		p2->next = w[b]->next;
		w[b]->next = p2;
}


using namespace std;
int main(){
	cin>>n;
	for(int i=1;i<=n-1;i++){
		int a,b,c;
		cin>>a>>b>>c;
		Add(a,b,c);
	}
	for(int i=1;i<=n;i++){
		vis[i] = true;
		dfs(i);	
		vis[i] = false;
	}
	cout<<MAX*10+(MAX+1)*MAX/2;
	return 0;
}

该方法会超时

解法三：

dfs两次，第一次找到一个离首都最远的点，第二次从最远的点开始，找到离其最远的点。

#include<cstring>
#include<algorithm>
#include<iostream>

int n;
typedef struct Node{
	int data;
	int dist;
	struct Node* next;
}Node,*node;
node w[100010];
bool vis[100010];
long long MAX=0,sum =0,findx =0;

void dfs(int s){
	node p = w[s]->next;
	while(p){
		if(!vis[p->data]){
			vis[p->data] = true;
			sum+=p->dist;
			dfs(p->data);
			sum-=p->dist;
			vis[p->data] = false;
		}
		p = p->next;
	} 
	if(MAX<sum){
		MAX = sum;
		findx = s;
	}
}
void Add(int a,int b,int c){
	if(w[a]==NULL){
		w[a] = (node)malloc(sizeof (Node));
		w[a]->next = NULL;
	}
	if(w[b] == NULL){
		w[b] = (node)malloc(sizeof (Node));
		w[b]->next = NULL;
	}
	    node p1 = (node)malloc(sizeof (Node));
		p1->data = b;
		p1->dist = c;
		p1->next = w[a]->next;
		w[a]->next = p1;
		node p2 = (node)malloc(sizeof (Node));
		p2->data = a;
		p2->dist = c;
		p2->next = w[b]->next;
		w[b]->next = p2;
}

using namespace std;
int main(){
	cin>>n;
	for(int i=1;i<=n-1;i++){
		int a,b,c;
		cin>>a>>b>>c;
		Add(a,b,c);
	}
		vis[1] = true;
		dfs(1);	
		vis[1] = false;
		vis[findx] = true;
		dfs(findx);
		vis[findx];
	cout<<MAX*10+(MAX+1)*MAX/2;
	return 0;
}