洛谷P3258 [JLOI2014]松鼠的新家 树剖+差分

---

洛谷P3258 [JLOI2014]松鼠的新家

---

标签

• 树链剖分

---

简明题意

• 太裸了

---

思路

• 太裸了，直接树剖，剖完用差分维护…太水了

---

注意事项

• 好吧其实也不那么水，要注意题目给的路径，在每个点处不要算重了，比如1，4，5，不是1-4，4-5，这样会把4算两次。。解决办法自己想想

---

总结

• 无

---

AC代码

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;

const int maxn = 3e5 + 10;

int n, m, order[maxn];
vector<int> g[maxn];

int dep[maxn], fa[maxn], son[maxn], siz[maxn];
void dfs1(int u, int f, int deep)
{
   dep[u] = deep;
   fa[u] = f;
   siz[u] = 1;

   int max_son = -1;
   for (auto& v : g[u])
   	if (v != f)
   	{
   		dfs1(v, u, deep + 1);
   		siz[u] += siz[v];
   		if (siz[v] > max_son)
   			max_son = siz[v], son[u] = v;
   	}
}

int top[maxn], id[maxn], cnt;
void dfs2(int u, int topf)
{
   id[u] = ++cnt;
   top[u] = topf;

   if (son[u])
   {
   	dfs2(son[u], topf);
   	for (auto& v : g[u])
   		if (v != fa[u] && v != son[u])
   			dfs2(v, v);
   }
}

int cf[maxn], b[maxn];

void solve()
{
   scanf("%d", &n);
   for (int i = 1; i <= n; i++)
   	scanf("%d", &order[i]);
   for (int i = 1; i < n; i++)
   {
   	int u, v;
   	scanf("%d%d", &u, &v);

   	g[u].push_back(v), g[v].push_back(u);
   }
   
   dfs1(1, 1, 1);
   dfs2(1, 1);

   for (int i = 2; i <= n; i++)
   {
   	int u = order[i - 1], v = order[i];

   	while (top[u] != top[v])
   	{
   		if (dep[top[v]] < dep[top[u]]) swap(u, v);

   		cf[id[top[v]]]++, cf[id[v] + 1]--;

   		v = fa[top[v]];
   	}

   	cf[min(id[u], id[v])]++, cf[max(id[u], id[v]) + 1]--;
   }
   	
   int l = order[1];

   int las = 0;
   for (int i = 1; i <= n; i++)
   	b[i] = b[i - 1] + cf[i];

   for (int i = 1; i <= n; i++)
   	printf("%d\n", i == l ? b[id[i]] : b[id[i]] - 1);
}

int main()
{
   freopen("Testin.txt", "r", stdin);
   solve();
   return 0;
}

---

双倍经验

• 无