Codeforces Round #196 (Div. 2) / 337D Book of Evil (树的直径变形——树的最长标记弦)

http://codeforces.com/contest/337/problem/D

/*154ms,10300KB*/

#include<bits/stdc++.h>
using namespace std;
const int mx = 100005;

vector<int> g[mx];
int d1[mx], d2[mx], p[mx];

void dfs(int p, int u, int deep, int D[])
{
	D[u] = deep;
	for (int i = 0; i < g[u].size(); i++)
	{
		int v = g[u][i];
		if (v != p) dfs(u, v, deep + 1, D); ///这样写就可以不用开vis数组了
	}
}

int main()
{
	int n, m, maxdeep, x, y;
	scanf("%d%d%d", &n, &m, &maxdeep);
	for (int i = 1; i <= m; i++) scanf("%d", &p[i]);
	for (int i = 1; i < n; i++)
	{
		scanf("%d%d", &x, &y);
		g[x].push_back(y);
		g[y].push_back(x);
	}
	dfs(0, 1, 0, d1);
	int t = 1;
	for (int i = 1; i <= m; i++)
		if (d1[p[i]] > d1[t]) t = p[i]; ///记录受影响的点中离1最远的点t
	dfs(0, t, 0, d1); ///d1是树的最长标记弦上距离点t的深度(t为树的最长标记弦的一端)
	for (int i = 1; i <= m; i++)
		if (d1[p[i]] > d1[t]) t = p[i]; ///树的最长标记弦的另一端
	dfs(0, t, 0, d2); ///d2是树的最长标记弦上距离点t'的深度(t'为树的最长标记弦的相对t另一端)
	int ans = 0;
	for (int i = 1; i <= n; i++)
		if (d1[i] <= maxdeep && d2[i] <= maxdeep) ans++;
	printf("%d\n", ans);
	return 0;
}