hdu 4912 Paths on the tree lca+贪心

直线型的树会爆栈，手动扩栈：#pragma comment(linker, "/STACK:102400000,102400000")

通过dfs离线求lca，把所有的查询都存储下来（分别用点索引和用查询的编号索引），通过一次dfs把所有点对的lca求出来

然后按照深度从深到浅依次尝试加入

#include<iostream>
#include<algorithm>
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#pragma comment(linker, "/STACK:102400000,102400000")//手动扩栈
int dir[4][2]={0,1,0,-1,1,0,-1,0};

const int maxn=100010;

int n,m;
int d[maxn],pa[maxn];//深度和用于并查集的parent数组
bool vis[maxn];//标记
vector<int>edges[maxn];//存树
vector<pair<int,int> >querys[maxn];//存储查询，<另一个点,查询编号>

struct Dian//存储查询
{
	int u;
	int v;
	int lca;//对于每个查询的lca
}dians[maxn];

int Find(int x)  
{  
    return x==pa[x]?x:pa[x]=Find(pa[x]);  
} 

void init()
{
	memset(pa,-1,sizeof(pa));
	memset(d,-1,sizeof(d));
	memset(vis,0,sizeof(vis));
	for(int i=1;i<=n;i++)
	{
		edges[i].clear();
		querys[i].clear();
	}
}

void dfs(int temp,int father)
{
	pa[temp]=temp;  
    pair<int,int>pii;  
	for(int i=0;i<querys[temp].size();i++)
	{
		pii=querys[temp][i];
		if(d[pii.first]!=-1) dians[pii.second].lca=Find(pii.first);
	}
	for(int i=0;i<edges[temp].size();i++)
	{
		int v=edges[temp][i];
		if(v==father)continue;
		d[v]=d[temp]+1;
		dfs(v,temp);
		pa[v]=temp;
	}
}

bool cmp(struct Dian a,struct Dian b)
{
	return d[a.lca]>d[b.lca];
}

void biaoji(int temp)
{
	vis[temp]=1;
	for(int i=0;i<edges[temp].size();i++)
	{
		int v=edges[temp][i];
		if(vis[v]==1||d[v]<d[temp])continue;
		biaoji(v);
	}
}

int main()
{
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		int i,j;
		int ta,tb;
		init();
		for(i=1;i<n;i++)
		{
			scanf("%d%d",&ta,&tb);
			edges[ta].push_back(tb);
			edges[tb].push_back(ta);
		}
		for(i=1;i<=m;i++)
		{
			scanf("%d%d",&ta,&tb);
			dians[i].u=ta;
			dians[i].v=tb;
			querys[ta].push_back(make_pair(tb,i));
			querys[tb].push_back(make_pair(ta,i));
		}
		d[1]=0;
		dfs(1,-1);
		sort(dians+1,dians+m+1,cmp);
		int ans=0;
		for(i=1;i<=m;i++)
		{
			if(vis[dians[i].u]==0&&vis[dians[i].v]==0)
			{
				ans++;
				biaoji(dians[i].lca);
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}