HDU 4123 Bob’s Race 树状DP+RMQ预处理

题意：给你一棵树，然后标号为1~n，每条边都有一定的边权，那么从每个点出发都有一个最远距离;

先用树状DP求出每个点的最远距离，再用RMQ处理区间的最大值和最小值。

注意在这里用log的话时间会浪费很多，所以需要预处理。

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <stack>
using namespace std;
#define ll long long
#define int64 __int64
#define M 100005
#define N 50005
#define inf 1<<30
#define mod 1000000007

struct node
{
	int ev , dis;
	int max1 , max2;
	int pos1 , pos2;
	int next;
}tree[N*2] , tp[N];
int n , m , tot , head[N];

void Addedge(int x , int y , int z)
{
	tree[tot].dis = z;
	tree[tot].ev = y;
	tree[tot].next = head[x];
	head[x] = tot++;
}

void Dfs1(int s , int fa)
{
	int i , v , dis;

	tp[s].max1 = tp[s].max2 = 0;
	tp[s].pos1 = tp[s].pos2 = -1;
	for (i = head[s] ; i != -1 ; i = tree[i].next)
	{
		v = tree[i].ev;
		dis = tree[i].dis;
		if (v == fa)continue;
		Dfs1(v,s);
		if (tp[s].max1 < tp[v].max1+dis)
		{
			tp[s].max2 = tp[s].max1;
			tp[s].pos2 = tp[s].pos1;

			tp[s].max1 = tp[v].max1+dis;
			tp[s].pos1 = v;
		}
		else if (tp[s].max2 < tp[v].max1+dis)
		{
			tp[s].max2 = tp[v].max1+dis;
			tp[s].pos2 = v;
		}
	}
}

void Dfs2(int s , int fa)
{
	int i , v , dis;

	for (i = head[s] ; i != -1 ; i = tree[i].next)
	{
		v = tree[i].ev;
		dis = tree[i].dis;
		if (v == fa)continue;
		if (tp[v].max1 < tp[s].max1+dis && tp[s].pos1 != v)
		{
			tp[v].max2 = tp[v].max1;
			tp[v].pos2 = tp[v].pos1;

			tp[v].max1 = tp[s].max1+dis;
			tp[v].pos1 = s;
		}
		else if (tp[v].max1 < tp[s].max2+dis && tp[s].pos2 != v)
		{
			tp[v].max2 = tp[v].max1;
			tp[v].pos2 = tp[v].pos1;

			tp[v].max1 = tp[s].max2+dis;
			tp[v].pos1 = s;
		}
		else if (tp[v].max2 < tp[s].max1+dis && tp[s].pos1 != v)
		{
			tp[v].max2 = tp[s].max1+dis;
			tp[v].pos2 = s;
		}
		else if (tp[v].max2 < tp[s].max2+dis && tp[s].pos2 != v)
		{
			tp[v].max2 = tp[s].max2+dis;
			tp[v].pos2 = s;
		}
		Dfs2(v,s);
	}
}

int dp[N][20][2];//0min,1max
int LOG[2*N];

void Init()
{
	int i , j;
	for (i = 1 ; i <= n ; i++)dp[i][0][0] = dp[i][0][1] = tp[i].max1;
	int k = LOG[n];
	for (i = 1 ; i <= k ; i++)
	{
		int lim = n-(1<<i)+1;
		for (j = 1 ; j <= lim ; j++)
		{
			int tmp = j+(1<<(i-1));
			dp[j][i][0] = min(dp[j][i-1][0],dp[tmp][i-1][0]);
			dp[j][i][1] = max(dp[j][i-1][1],dp[tmp][i-1][1]);
		}
	}
}

int rmq_min(int l , int r)
{
	int k = LOG[r-l+1];
	int tmp = 1<<k;
	return min(dp[l][k][0],dp[r-tmp+1][k][0]);
}

int rmq_max(int l , int r)
{
	int k = LOG[r-l+1];
	int tmp = 1<<k;
	return max(dp[l][k][1],dp[r-tmp+1][k][1]);
}

int Solve(int q)
{
	int l = 1 , r = 1 , ret = 0;
	while (r <= n)
	{
		int x = rmq_min(l,r);
		int y = rmq_max(l,r);
		if (y-x <= q)
		{
			ret = max(ret,r-l+1);
			r++;
		}
		else l++;
	}
	return ret;
}

int main()
{
	int i;
	LOG[0] = -1;
	for (i = 1 ; i <= 50000 ; i++)LOG[i] = LOG[i>>1]+1;
	while (scanf("%d%d",&n,&m) , m+n)
	{
		tot = 0;
		memset(head , -1 , sizeof head);
		for (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,0);
		Dfs2(1,0);

		Init();

		while (m--)
		{
			int q;
			scanf("%d",&q);
			printf("%d\n",Solve(q));
		}
	}
	return 0;
}