树形dp（不定期更新）

题目1：Genghis Khan the Conqueror HDU - 4126

分析：

感谢几篇写得比较好的博文帮我理解此题：
https://blog.csdn.net/ramay7/article/details/52236040
https://blog.csdn.net/gatevin/article/details/47042021
https://blog.csdn.net/u014664226/article/details/49333081
可以枚举每个点，然后考虑这个点所有的贡献：
以这个点为根进行dfs，对每个边我们只用当前的根节点进行松弛操作，自底向上一层一层的求dp，搜完之后枚举下一个根节点。

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
const ll mod = 1e9 + 7;
const int maxn = 3010;
const int inf = 0x3f3f3f3f;
struct edge
{
	int x, y, val;
	edge(int a = 0, int b = 0, int c = 0) : x(a), y(b), val(c){}
	bool operator< (const edge& b) const
	{
		return val < b.val;
	}
}e[9000004];
vector<int> g[maxn];
int used[maxn][maxn], dis[maxn][maxn], dp[maxn][maxn];
int fa[maxn];
int n, m, k;

void init()
{
	for(int i = 0; i < n; i++)
	{
		g[i].clear();
		fa[i] = i;
		for(int j = 0; j < n; j++)
			dp[i][j] = dis[i][j] = inf, used[i][j] = 0;
	}
}

int find(int x)
{
	return fa[x] = x == fa[x] ? fa[x] : find(fa[x]);
}

ll kruscal()
{
	int cnt = 0;
	ll mst = 0;

	for(int i = 1; i <= m; i++)
	{
		int fx = find(e[i].x), fy = find(e[i].y);
		if(fx == fy) continue;
		g[e[i].x].push_back(e[i].y), g[e[i].y].push_back(e[i].x);
		fa[fx] = fy;
		cnt++, mst += e[i].val;
		used[e[i].x][e[i].y] = used[e[i].y][e[i].x] = 1;
		if(cnt == n - 1) break;
	}
	return mst;
}

int dfs(int root, int u, int f)
{
	int minn = inf;
	for(int i = 0; i < g[u].size(); i++)
	{
		int v = g[u][i];
		if(v == f) continue;
		int tmp = dfs(root, v, u);
		minn = min(minn, tmp);
		dp[u][v] = dp[v][u] = min(dp[u][v], tmp);
	}
	if(f != root) minn = min(minn, dis[root][u]);
	return minn;
}

int main()
{
	while(scanf("%d%d", &n, &m) && (n || m))
	{
		init();
		for(int i = 1; i <= m; i++)
		{
			scanf("%d%d%d", &e[i].x, &e[i].y, &e[i].val);
			dis[e[i].x][e[i].y] = dis[e[i].y][e[i].x] = e[i].val;
		}
		sort(e + 1, e + 1 + m);

		ll mst = kruscal();
		for(int i = 0; i < n; i++) 
			dfs(i, i, -1);
		scanf("%d", &k);
		ll res = 0;
		for(int i = 1; i <= k; i++)
		{
			int a, b, c; scanf("%d%d%d", &a, &b, &c);
			if(!used[a][b]) res += mst;
			else res += mst - dis[a][b] + min(c, dp[a][b]);
		}
		printf("%.4lf\n", 1.0 * res / k);
	}
}

题目2：Bob’s Race HDU - 4123

分析：

1、两遍dfs求出每个点到其他点的最长距离
2、ST表求连续区间最大值和最小值
3、单调队列求满足题意的最长区间
4、注意：不要直接调用$lo{g}_2$的库函数，会tle，可以写个location数组或者每次循环找$lo{g}_{2}n$(时间复杂度*10)

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
const ll mod = 1e9 + 7;
const int maxn = 5e4 + 10;
const int inf = 0x3f3f3f3f;
struct edge
{
	int ep, val, nex;
	edge(int a = 0, int b = 0, int c = 0) : ep(a), val(b), nex(c){}
}e[maxn << 1];
int head[maxn], tot;
int maxlen[maxn], smaxlen[maxn], maxid[maxn], smaxid[maxn];
int n, m; 

void init()
{
	mem(head, -1), tot = 0;
}

void addedge(int u, int v, int val)
{
	e[tot] = edge(v, val, head[u]);
	head[u] = tot++;
}

void dfs1(int u, int fa)
{
	maxlen[u] = 0, smaxlen[u] = 0;
	for(int i = head[u]; ~i; i = e[i].nex)
	{
		int v = e[i].ep;
		if(v == fa) continue;
		dfs1(v, u);
		if(maxlen[v] + e[i].val > smaxlen[u])
		{
			smaxlen[u] = maxlen[v] + e[i].val;
			smaxid[u] = v;
			if(smaxlen[u] > maxlen[u])
				swap(smaxlen[u], maxlen[u]), swap(smaxid[u], maxid[u]);
		}
	}
}

void dfs2(int u, int fa)
{
	for(int i = head[u]; ~i; i = e[i].nex)
	{
		int v = e[i].ep;
		if(v == fa) continue;
		int len = maxid[u] == v ? smaxlen[u] : maxlen[u]; len += e[i].val;
		if(len > smaxlen[v])
		{
			smaxlen[v] = len;
			smaxid[v] = u;
			if(maxlen[v] < smaxlen[v])
				swap(maxlen[v], smaxlen[v]), swap(maxid[v], smaxid[v]);
		}
		dfs2(v, u);
	}
}

int maxdp[maxn][32], mindp[maxn][32];
int location[maxn];

void rmqinit()
{
	location[0] = -1;
	for(int i = 1; i <= n; i++) 
		location[i]=(i&(i-1))==0?location[i-1]+1:location[i-1];

	for(int i = 1; i <= n; i++) 
		maxdp[i][0] = mindp[i][0] = maxlen[i];
	for(int j = 1; (1 << j) <= n; j++)
		for(int i = 1; i + (1 << j) - 1 <= n; i++)
		{
			maxdp[i][j] = max(maxdp[i][j - 1], maxdp[i + (1 << (j - 1))][j - 1]);
			mindp[i][j] = min(mindp[i][j - 1], mindp[i + (1 << (j - 1))][j - 1]);
		}
}

int find(int q)
{
	int l, r;
	int maxx = 0;

	l = r = 1;
	while(r <= n)
	{
		int len = location[r - l + 1];
		int tmp = max(maxdp[l][len], maxdp[r - (1 << len) + 1][len]) - min(mindp[l][len], mindp[r - (1 << len) + 1][len]);
		if(tmp <= q)
			maxx = max(maxx, r - l + 1), r++;
		else
			l++;
	}
	return maxx;
}

int main()
{
	while(scanf("%d%d", &n, &m) && (n || m))
	{
		init();
		for(int i = 1; i < n; i++)
		{
			int x, y, z; scanf("%d%d%d", &x, &y, &z);
			addedge(x, y, z);
			addedge(y, x, z);
		}
		dfs1(1, -1);
		dfs2(1, -1);
		// for(int i = 1; i <= n; i++) print(minlen[i]);
		rmqinit();
		
		while(m--)
		{
			int q; scanf("%d", &q);
			printf("%d\n", find(q));
		}
	}
}