CodeForces 1084D :The Fair Nut and the Best Path 树形DP

最新推荐文章于 2024-10-08 20:32:22 发布

匿枫

最新推荐文章于 2024-10-08 20:32:22 发布

阅读量87

点赞数

文章标签：动态规划算法概率论

本文链接：https://blog.csdn.net/tlyzxc/article/details/120116284

版权

树形DP 最大权值链动态规划 DFS

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

传送门

题意

在这里插入图片描述

分析

无根树选一个最大权值和的链，显然是树形 $D P$
分析两种情况，一种情况是以 $u$ 为终点，一种情况是以 $u$ 为中转点

终点
$f [u] [0] = m 1 + a [u]$
中转点
$f [u] [1] = m 1 + a [u] + m 2$

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 3e5 + 10,M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],ne[M],e[M],idx;
ll f[N],a[N],w[M],ans;
int n;

void add(int x,int y,int z){
	ne[idx] = h[x],e[idx] = y,w[idx] = z,h[x] = idx++;
}

void dfs(int u,int fa){
	ll m1 = 0,m2 = 0;
	for(int i = h[u];~i;i = ne[i]){
		int j = e[i];
		if(j == fa) continue;
		dfs(j,u);
		if(f[j] - w[i] >= m1){
			m2 = m1;
			m1 = f[j] - w[i];
		}
		else if(f[j] - w[i] > m2) m2 = f[j] - w[i];
	}
	f[u] = m1 + a[u];
	ans = max(ans,m1 + m2 + a[u]);
}

int main() {
	memset(h,-1,sizeof h);
	read(n);
	for(int i = 1;i <= n;i++) read(a[i]);
	for(int i = 1;i < n;i++){
		int x,y,z;
		read(x),read(y),read(z);
		add(x,y,z),add(y,x,z);
	}
	dfs(1,0);
	dl(ans);
	return 0;
}