POJ - 1741(点分治入门)

tree

其实关于时间复杂度我也似懂非懂，大概就是把一颗树分层，然后每一层的操作大概是（n log N），然后我们每次找树的重心，就可以分logN层，所以总时间复杂度大概是就是N log² N
关于路径，我们先算出到根的距离，然后分成两种，一种关于经过n节点，这是合法的，一种是不经过根节点，就是在一根子树下的，我们可以先算根节点的所有情况，再计算孩子节点的情况，然后减掉就好了。
然后计算路径用尺取就好了。

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
#define LL long long
const int maxn = 10100;
const LL mod = 1e9 + 7;
const LL inf = 1e15;
struct node
{
	int v, val, nxt;
}e[maxn << 2];
int head[maxn], cnt, ans;
int dist[maxn], vis[maxn], mx[maxn], son[maxn];
int mini, root, num, n, k;
void add(int u, int v, int val)
{
	e[++cnt].v = v;
	e[cnt].val = val;
	e[cnt].nxt = head[u];
	head[u] = cnt;
}
void dfssize(int u, int fa)
{
	son[u] = 1;
	mx[u] = 0;
	for (int i = head[u]; i; i = e[i].nxt)
	{
		int v = e[i].v;
		if (vis[v] || v == fa)continue;
		dfssize(v, u);
		son[u] += son[v];
		if (son[v] > mx[u])mx[u] = son[v];
	}
}
void dfsroot(int r, int u, int fa)
{ 
	if (son[r] - son[u] > mx[u])mx[u] = son[r] - son[u];
	if (mx[u] < mini)mini = mx[u], root = u;
	for (int i = head[u]; i; i = e[i].nxt)
	{
		int v = e[i].v;
		if (vis[v] || v == fa)continue;
		dfsroot(r, v, u); 
	}
}
void dfsdist(int u, int d, int fa)
{
	dist[num++] = d;
	for (int i = head[u]; i; i = e[i].nxt)
	{
		int v = e[i].v;
		if (vis[v] || v == fa)continue;
		dfsdist(v, d + e[i].val, u);
	}
}
int cal(int t, int d)
{
	num = 0;
	dfsdist(t, d, 0);
	sort(dist, dist + num);
	int res = 0, l = 0, r = num - 1;
	while (l < r)
	{
		while (dist[l] + dist[r] > k && l < r) r--;
		res += r - l;
		l++;
	}
	return res;
}
void dfs(int u)
{
	mini = n;
	dfssize(u,0);
	dfsroot(u, u, 0);
	ans += cal(root, 0);
	vis[root] = 1;
	for (int i = head[root]; i; i = e[i].nxt)
	{
		int v = e[i].v;
		if (!vis[v])
		{
			ans -= cal(v, e[i].val);
			dfs(v);
		}
	}
}
int main()
{
	int u, v, val;
	while (~scanf("%d%d", &n, &k))
	{
		if (n == 0 && k == 0)break;
		memset(head, 0, sizeof(head));
		memset(vis, 0, sizeof(vis));
		cnt = 0, ans = 0;
		for (int i = 1; i < n; i++)
		{
			scanf("%d%d%d", &u, &v, &val);
			add(u, v, val), add(v, u, val);
		}
		dfs(1);
		printf("%d\n", ans);
	}
	return 0;
}