[BZOJ 1758]重建计划

树分治

注意二分在里面

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

#define maxn 200020
using namespace std;


int n, m, L, U;

struct Edge{
	int to, next, dis;
}edge[maxn];

int h[maxn], cnt;

void add(int u, int v, int d){
	++ cnt;
	edge[cnt].to = v;
	edge[cnt].next = h[u];
	edge[cnt].dis = d;
	h[u] = cnt;
}

int TMP;

bool vis[maxn];

int size[maxn], Lim;
void Get_G(int u, int fa, int siz, int& rt){
	size[u] = 1;
	int f = 0;
	for(int i = h[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if(vis[v] || v == fa)continue;
		Get_G(v, u, siz, rt);
		size[u] += size[v];
		f = max(f, size[v]);
	}
	f = max(f, siz - size[u]);
	if((f << 1) <= siz)
	    rt = u;
}

const double inf = 0x7fffffff;

int que[maxn], dq[maxn];

int inq[maxn], tim;

double dis[maxn], mx[maxn];

int dep[maxn];

bool pd(int u, double f){
	int up = 0;
	mx[up] = 0;
	for(int i = h[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if(vis[v])continue;
		inq[u] = inq[v] = ++ tim;
		dep[v] = 1;
		dis[v] = edge[i].dis - f;
		int head = 1, tail = 1;
		que[tail ++] = v;
		while(head < tail){
			int p = que[head ++];
			for(int j = h[p]; j; j = edge[j].next){
				int q = edge[j].to;
				if(vis[q] || inq[q] == tim)continue;
				inq[q] = tim;
				que[tail ++] = q;
				dep[q] = dep[p] + 1;
				dis[q] = dis[p] + edge[j].dis - f;
			}
		}
		
		int t = tail - 1, now = up, l = 1, r = 1;
		
		for(int j = 1; j <= t; j ++){
			int x = que[j];
			while(dep[x] + now >= L && now >= 0){
				while(l < r && mx[dq[r - 1]] < mx[now])
				    r --;
				dq[r ++] = now;
				now --;
			}
			while(l < r && dep[x] + dq[l] > U)
			    l ++;
			if(l < r && mx[dq[l]] + dis[x] >= 0)
				return true;
		}
		
		for(int j = up + 1; j <= dep[que[t]]; j ++)
		    mx[j] = -inf;
		    
		for(int j = 1; j <= t; j ++){
			int x = que[j];
			mx[dep[x]] = max(mx[dep[x]], dis[x]);
		}
		up = max(up, dep[que[t]]);
	}return false;
}

double ans;

const double eps = 1e-4;

void check(int u){
	double l = ans, r = Lim;
	while(r - l > eps){
		double mid = (l + r) / 2;
		if(pd(u, mid))l = mid;
		else r = mid;
	}
	ans = l;
}

void solve(int u){
	check(u);
	vis[u] = true;
	for(int i = h[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if(vis[v])continue;
		if(size[v] > L){
			TMP = v;
			Get_G(v, -1, size[v], TMP);
			solve(TMP);
		}
	}
}

int main(){
	scanf("%d%d%d", &n, &L, &U);
	int u, v, d;
	for(int i = 1; i < n; i ++){
		scanf("%d%d%d", &u, &v, &d);
		add(u, v, d);
		add(v, u, d);
		Lim = max(Lim, d);
	}
	
	Get_G(1, -1, n, TMP);
	solve(TMP);
	printf("%.3lf\n", ans);
    return 0;
}