poj 1741

还是树分治，听说这题挺经典就拿来做一下，发现比上题简单。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctime>
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
//typedef pair<int,int> pii; 
#define INF 1e9
#define MAXN 10000
#define MAXM 100
const int maxn = 10005;
const int mod = 1000003;
#define eps 1e-6
#define pi 3.1415926535897932384626433
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define scan(n) scanf("%d",&n)
#define scanll(n) scanf("%I64d",&n)
#define scan2(n,m) scanf("%d%d",&n,&m)
#define scans(s) scanf("%s",s);
#define ini(a) memset(a,0,sizeof(a))
#define out(n) printf("%d\n",n)
//ll gcd(ll a,ll b) { return b==0?a:gcd(b,a%b);}
#define mk(n,m) make_pair(n,m)

using namespace std;
vector< pair<int,int> > G[maxn];
bool vis[maxn];
int son[maxn];
int cnt;
int n, K;
int wval,wroot;
vector<int> dep;
int d[maxn];
int ans;
void init(int n)
{
	ini(vis);
	ini(son);
	rep1(i,n) G[i].clear();
}
void getRoot(int u,int fa) //求u所在“连通块”的重心，一遍dfs，复杂度O(N)
{
	son[u] = 1;
	int mxv = 0;
	for(int i = 0;i < G[u].size(); i++)
	{
		int v = G[u][i].first;
		if(vis[v] || v == fa) continue;
		getRoot(v,u);
		son[u] += son[v];
		mxv = max(mxv, son[v]);
	}

	mxv = max(mxv,son[0] - son[u]);
	if(wval > mxv)
	{
		wroot = u;
		wval = mxv;
	}
}
void dfs(int u,int fa,int Prep)
{
	dep.push_back(d[u]);
	son[u] = 1;
	for(int i = 0;i < G[u].size(); i++)
	{
		int v = G[u][i].first;
		if(vis[v] || v == fa) continue;
		d[v] = d[u] + G[u][i].second;
		dfs(v,u,d[v]);
		son[u] += son[v];
	}
}
int cal(int u,int Prep)
{
	dep.clear();
	dfs(u,-1,Prep);
	sort(dep.begin(),dep.end());
	int ret = 0;
	int l = 0,r = dep.size() - 1;
	while(l < r)
	{
		if(dep[l] + dep[r] <= K)
		{
			ret += r - l;
			l ++;
		}
		else r--;
	}
	return ret;
}
void solve(int u,int all)
{
	//cout<<u<<' '<<all<<endl;
	if(all == 1) return; 
	son[0] = all;
	wval = INF;
	getRoot(u,-1);

	u = wroot;
	d[u] = 0;
	ans += cal(u,0);
	vis[u] = 1;
	for(int i = 0;i < G[u].size(); i++)
	{
		int v = G[u][i].first;
		if(vis[v] || v == u) continue;
		ans -= cal(v,G[u][i].second);
		solve(v,son[v]);
	}

}
int main()
{
#ifndef ONLINE_JUDGE  
	freopen("in.txt","r",stdin);  
	//   freopen("out.txt","w",stdout);  
#endif 
	while(~scanf("%d%d",&n,&K) && (n + K))
	{
		init(n);
		int x,y,l;
		rep(i,n-1)
		{
			scanf("%d%d%d",&x,&y,&l);
			G[x].push_back(mk(y,l));
			G[y].push_back(mk(x,l));
		}
		ans = 0;
		solve(1,n);
		cout<<ans<<endl;
	}

	return 0;
}