大臣的旅费

0x7F7F

于 2020-10-31 15:19:38 发布

阅读量630

点赞数

分类专栏：蓝桥杯文章标签： dfs c++

本文链接：https://blog.csdn.net/weixin_45729807/article/details/109403048

版权

深度优先搜索图算法最大边权路径 DFS 路径优化

关键词由CSDN通过智能技术生成

蓝桥杯专栏收录该内容

5 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<vector>
#include<cstring>

using namespace std;

const int N = 1e5 + 10;

struct Edge {
  int f, t, v;
}edge[N];                                                                                           
int n;
int cnt;
int value;
int maxValue,maxValueIndex;
vector<int> vis;
vector<int> occurrences;

void dfs(int edgeNum)
{
  bool flag = false;
  vis[edgeNum] = 1;
  ++occurrences[edge[edgeNum].f];
  ++occurrences[edge[edgeNum].t];
  value += edge[edgeNum].v;
  for(int i = 1; i <= cnt; ++i)
  {
    if((edge[edgeNum].f == edge[i].f || edge[edgeNum].f == edge[i].t || edge[edgeNum].t == edge[i].f || edge[edgeNum].t == edge[i].t) && vis[i] == 0 && occurrences[edge[i].f] < 2 && occurrences[edge[i].t] < 2)
    {
      flag = true; 
      dfs(i);
    }
  }
  if(!flag)
  {
    if(value > maxValue)
    {
      maxValue = value;
      maxValueIndex = edgeNum;
    }
  }
  vis[edgeNum] = 0;
  --occurrences[edge[edgeNum].f];
  --occurrences[edge[edgeNum].t];
  value -= edge[edgeNum].v;
}
int main()
{
  cin >> n;
  vis = vector<int>(n + 10, 0);
  occurrences = vector<int>(n + 10, 0);

  cnt = 0;
  int begin, end, v;
  for(int i = 0; i < n - 1; ++i)
  {
    cin >> begin >> end >> v;
    edge[++cnt].f = begin;
    edge[cnt].t = end;
    edge[cnt].v = v;
  }
  maxValue = 0;
  dfs(1);
  dfs(maxValueIndex);
  cout << (maxValue * maxValue + 21 * maxValue) / 2 << endl;
  return 0;
}