POJ 3162 Walking Race【树形DP + 线段树】

Walking Race

题意： 题意大致是，$n$天，第$i$天点$i$出发，跑到距离$i$点最远的点，记录距离。求最大的连续天数，使得其中的$最大距离-最小距离<m$

题解： 树形DP求解每个点的最远距离，然后线段树求区间最大最小值即可。

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn = 1e6 + 10;

#define lrt rt << 1
#define rrt rt << 1 | 1

int n, m, ans;
int dp[maxn][3];

int cnt, head[maxn];
struct edge { 
	int v, w, next; 
	edge () {}
	edge (int v, int w, int next) : v(v), w(w), next(next) {}
} e[maxn << 1];
void add (int u, int v, int w) {
	e[++cnt] = edge(v, w, head[u]); head[u] = cnt;
	e[++cnt] = edge(u, w, head[v]); head[v] = cnt;
}

void dfs (int u, int fa) {
	int fir = 0, sec = 0;
	for (int i = head[u]; i; i = e[i].next) {
		int v = e[i].v, w = e[i].w;
		if (v == fa) continue;
		dfs(v, u);
		
		int c = dp[v][0] + w;
		if (c > fir) sec = fir, fir = c;
		else if (c > sec) sec = c;
	}
	dp[u][0] = fir;
	dp[u][1] = sec;
}

void DFS (int u, int fa) {
	for (int i = head[u]; i; i = e[i].next) {
		int v = e[i].v, w = e[i].w;
		if (v == fa) continue;
		if (dp[u][0] == dp[v][0] + w) dp[v][2] = max(dp[u][1], dp[u][2]) + w;
		else dp[v][2] = max(dp[u][0], dp[u][2]) + w;
		
		DFS(v, u);
	}
}

struct node { 
	int l, r, max, min;
	int mid () { return l + r >> 1; }
} T[maxn << 2];

void build (int l, int r, int rt) {
	T[rt].l = l, T[rt].r = r;
	if (l == r) return (void)(T[rt].max = T[rt].min = max(dp[l][0], dp[l][2]));
	
	int mid = T[rt].mid();
	build(l, mid, lrt);
	build(mid + 1, r, rrt);
	
	T[rt].max = max(T[lrt].max, T[rrt].max);
	T[rt].min = min(T[lrt].min, T[rrt].min);
}

int max (int l, int r, int rt) {
	if (T[rt].l >= l && T[rt].r <= r) return T[rt].max;
	
	int mid = T[rt].mid();
	int maxx = 0;
	if (l <= mid) maxx = max(maxx, max(l, r, lrt));
	if (r >  mid) maxx = max(maxx, max(l, r, rrt));
	return maxx;
}

int min (int l, int r, int rt) {
	if (T[rt].l >= l && T[rt].r <= r) return T[rt].min;
	
	int mid = T[rt].mid();
	int minn = maxn;
	if (l <= mid) minn = min(minn, min(l, r, lrt));
	if (r >  mid) minn = min(minn, min(l, r, rrt));
	return minn;
}

void run () {
	ans = 1, cnt = 0;
	memset(dp, 0, sizeof dp);
	memset(head, 0, sizeof head);
	
	for (int v = 2, u, w; v <= n; ++v) {
		scanf("%d%d", &u, &w);
		add(u, v, w);
	}
	dfs(1, 0); DFS(1, 0);
	build(1, n, 1);
	int i = 1, j = 2;
	while (i <= j && j <= n) {
		int maxx = max(i, j, 1);
		int minn = min(i, j, 1);
		if (maxx - minn <= m) ans = max(ans, j - i + 1), ++j;
		else ++i;
		if (n - i < ans) break;
	}
	printf("%d\n", ans);
}

int main () {
	while (~scanf("%d%d", &n, &m)) run();
	return 0;
}