Codeforces Round #328 D Super M（树的直径+树形DP）

题意：给出一棵树，树上有n个点，现从中选出m个点，并可以从任意一个点出发，求出到达所有点的最短时间。

思路：首先这些点中距离最远的两个点，然后对于这条链上的每个点u，用树形DP求出从u出发，经过子树中选中的的点并返回的最小时间，最后 加上走完直径的时间就是答案。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;

const int MAXN = 155000;
int n, m;
vector<int> G[MAXN]; 
bool vis[MAXN];
int st, ed, len;
int d[MAXN], att[MAXN];
bool attack[MAXN];
void bfs1(int cur) {
	queue<int> q;
	q.push(cur); 
	vis[cur] = 1;
	d[cur] = 0;
	st = 0;
	d[0] = -1;
	while(!q.empty()) {
		int t = q.front();
		q.pop();
		for(int i = 0; i < G[t].size(); i++) {
			int u = G[t][i];
			if(vis[u]) continue;
			vis[u] = 1;
			d[u] = d[t] + 1;
			if(attack[u]) {
				if(d[u] > d[st]) st = u;
				else st = min(u, st);
			}
			q.push(u);
		}
	}
}
void bfs2() {
	memset(vis, 0, sizeof(vis));
	queue<int> q;
	q.push(st); 
	vis[st] = 1;
	d[st] = 0;
	ed = 0;
	d[0] = -1;
	while(!q.empty()) {
		int t = q.front();
		q.pop();
		for(int i = 0; i < G[t].size(); i++) {
			int u = G[t][i];
			if(vis[u]) continue;
			vis[u] = 1;
			d[u] = d[t] + 1;
			if(attack[u]) {
				if(d[u] > d[ed]) ed = u;
				else ed = min(u, ed);
			}
			q.push(u);
		}
	}
	len = d[ed];
}
int fa[MAXN];
void dfs2(int cur, int f) {
	fa[cur] = f;
	for(int i = 0; i < G[cur].size(); i++) {
		int u = G[cur][i];
		if(u == f) continue;
		dfs2(u, cur);
	}
} 
int dp[MAXN];
void dfs3(int cur, int f, int last) {
	dp[cur] = 0;
	for(int i = 0; i < G[cur].size(); i++) {
		int u = G[cur][i];
		if(u==f || u==last) continue;
		dfs3(u, cur, last);
		if(dp[u] >= 0) dp[cur] += 2 + dp[u];
	}
	if(!dp[cur]) dp[cur] = -1;
	if(attack[cur]) dp[cur] = max(0, dp[cur]);
}
int main() {
    //freopen("input.txt", "r", stdin);
	cin >> n >> m;
	for(int i = 1, u, v; i < n; i++) {
		scanf("%d%d", &u, &v);
		G[u].push_back(v);
		G[v].push_back(u);
	}
	for(int i = 1, u; i <= m; i++) scanf("%d", &u), attack[u] = 1, att[i] = u;
	if(m==1) {
		cout << att[1] << endl << "0" << endl;
		return 0;
	}
	bfs1(att[1]);
	bfs2();
    dfs2(st, 0);
    memset(dp, -1, sizeof(dp));
	int l = 0;
	int pos = ed;
	dfs3(pos, fa[pos], l);
	do {
		l = pos;
		pos = fa[pos];
		dfs3(pos, fa[pos], l);
		//cout << pos << endl;
	} while(pos != st);
	int ret = len;
	pos = ed;
	while(pos != 0) ret += max(dp[pos],0), pos = fa[pos];
    cout << min(st, ed) << endl << ret << endl;
	return 0;
}