【LOJ - P2986】:Great Cow Gathering G 树形DP + 二次扫描

传送门

分析

比上一题简单一点,我们预处理一下 f [ 1 ] f[1] f[1]的值,然后 f [ 1 ] f[1] f[1]的子节点的状态转移方程就是
f [ j ] = f [ u ] − w [ i ] ∗ s z [ j ] + ( s z [ 1 ] − s z [ j ] ) ∗ w [ i ] ; f[j] = f[u] - w[i] * sz[j] + (sz[1] - sz[j]) * w[i]; f[j]=f[u]w[i]sz[j]+(sz[1]sz[j])w[i];
比较简单就不再过多分析了

代码

#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 ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e6 + 10;
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;}
ll w[N],a[N],d[N],f[N],sz[N];
int n;
int h[N],e[N],ne[N],idx;

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

void dfs(int u,int fa){
	sz[u] = a[u];
	for(int i = h[u];~i;i = ne[i]){
		int j = e[i];
		if(j == fa) continue;
		d[j] = d[u] + w[i];
		dfs(j,u);
		sz[u] += sz[j];
	}
}

void dfs_(int u,int fa){
	for(int i = h[u];~i;i = ne[i]){
		int j = e[i];
		if(j == fa) continue;
		f[j] = f[u] - w[i] * sz[j] + (sz[1] - sz[j]) * w[i];
		dfs_(j,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;
		ll z;
		read(x),read(y),read(z);
		add(x,y,z),add(y,x,z);
	}
	dfs(1,-1);
	for(int i = 1;i <= n;i++) f[1] += d[i] * a[i];
	dfs_(1,-1);
	ll ans = INF;
	for(int i = 1;i <= n;i++) ans = min(ans,f[i]);
	dl(ans);
	return 0;
}

/**
*  ┏┓   ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃       ┃
* ┃   ━   ┃ ++ + + +
*  ████━████+
*  ◥██◤ ◥██◤ +
* ┃   ┻   ┃
* ┃       ┃ + +
* ┗━┓   ┏━┛
*   ┃   ┃ + + + +Code is far away from  
*   ┃   ┃ + bug with the animal protecting
*   ┃    ┗━━━┓ 神兽保佑,代码无bug 
*   ┃        ┣┓
*    ┃        ┏┛
*     ┗┓┓┏━┳┓┏┛ + + + +
*    ┃┫┫ ┃┫┫
*    ┗┻┛ ┗┻┛+ + + +
*/


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值