洛谷P1505 [国家集训队]旅游 树剖+边权化点权+线段树

---

洛谷P1505 [国家集训队]旅游

---

标签

• 树链剖分
• 边权化点权
• 线段树

---

简明题意

• 给一棵树及边权，需要支持5种操作：
  1. 修改：将第i条边权改为c
  2. 修改：将u–v路径的所有边权全部取相反数
  3. 查询：查询u–v路径中的边权和
  4. 查询：查询u–v路径中边权最大值
  5. 查询：查询u–v路径中边权最小值

---

思路

• 果断边权化点权，然后剖，剖完用tag线段树维护。于是就成了板子题，很简单了

---

注意事项

• 查最值的时候，记得把初始赋成无穷大或无穷小~

---

总结

• 无

---

AC代码

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

const int maxn = 1e5 + 10;

struct Edge
{
   int v, w;
   Edge(int v, int w) : v(v), w(w) {}
};

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

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

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

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

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

int LCA(int u, int v)
{
   while (top[u] != top[v])
   {
   	if (dep[top[v]] < dep[top[u]]) swap(u, v);
   	v = fa[top[v]];
   }
   return dep[u] < dep[v] ? u : v;
}

struct Node
{
   int l, r, e;
   int max, min, sum;
   int tag;
};

Node tree[maxn * 4];

void spread(int o)
{
   if (tree[o].tag)
   {
   	tree[o].sum *= -1;
   	swap(tree[o].min, tree[o].max);
   	tree[o].min *= -1, tree[o].max *= -1;
   	if (tree[o].l != tree[o].r)
   		tree[o * 2].tag ^= 1, tree[o * 2 + 1].tag ^= 1;
   	tree[o].tag = 0;
   }
}

void update(int o)
{
   if (tree[o].l != tree[o].r)
   {
   	spread(o * 2), spread(o * 2 + 1);
   	tree[o].max = max(tree[o * 2].max, tree[o * 2 + 1].max);
   	tree[o].min = min(tree[o * 2].min, tree[o * 2 + 1].min);
   	tree[o].sum = tree[o * 2].sum + tree[o * 2 + 1].sum;
   }
}

void build(int o, int l, int r)
{
   tree[o].l = l, tree[o].r = r;
   if (l == r)
   {
   	tree[o].e = tree[o].max = tree[o].min = tree[o].sum = w[l];
   	return;
   }

   int mid = (l + r) / 2;
   build(o * 2, l, mid);
   build(o * 2 + 1, mid + 1, r);

   update(o);
}

void change1(int o, int x, int c)
{
   spread(o);

   if (tree[o].l == tree[o].r)
   {
   	tree[o].e = tree[o].max = tree[o].min = tree[o].sum = c;
   	return;
   }

   int mid = (tree[o].l + tree[o].r) / 2;
   if (x <= mid)
   	change1(o * 2, x, c);
   else
   	change1(o * 2 + 1, x, c);

   update(o);
}

void change2(int o, int l, int r)
{
   spread(o);

   if (tree[o].l == l && tree[o].r == r)
   {
   	tree[o].tag ^= 1;
   	spread(o);
   	return;
   }

   int mid = (tree[o].l + tree[o].r) / 2;
   if (r <= mid)
   	change2(o * 2, l, r);
   else if (l > mid)
   	change2(o * 2 + 1, l, r);
   else
   	change2(o * 2, l, mid), change2(o * 2 + 1, mid + 1, r);

   update(o);
}

int ask_sum(int o, int l, int r)
{
   spread(o);

   if (tree[o].l == l && tree[o].r == r)
   	return tree[o].sum;

   int mid = (tree[o].l + tree[o].r) / 2;
   if (r <= mid)
   	return ask_sum(o * 2, l, r);
   else if (l > mid)
   	return ask_sum(o * 2 + 1, l, r);
   else
   	return ask_sum(o * 2, l, mid) + ask_sum(o * 2 + 1, mid + 1, r);
}

int ask_max(int o, int l, int r)
{
   spread(o);

   if (tree[o].l == l && tree[o].r == r)
   	return tree[o].max;

   int mid = (tree[o].l + tree[o].r) / 2;
   if (r <= mid)
   	return ask_max(o * 2, l, r);
   else if (l > mid)
   	return ask_max(o * 2 + 1, l, r);
   else
   	return max(ask_max(o * 2, l, mid), ask_max(o * 2 + 1, mid + 1, r));
}

int ask_min(int o, int l, int r)
{
   spread(o);

   if (tree[o].l == l && tree[o].r == r)
   	return tree[o].min;

   int mid = (tree[o].l + tree[o].r) / 2;
   if (r <= mid)
   	return ask_min(o * 2, l, r);
   else if (l > mid)
   	return ask_min(o * 2 + 1, l, r);
   else
   	return min(ask_min(o * 2, l, mid), ask_min(o * 2 + 1, mid + 1, r));
}

struct Point
{
   int u, v;
};

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

   	rec[i].u = ++u, rec[i].v = ++v;

   	g[u].push_back(Edge(v, w)), g[v].push_back(Edge(u, w));
   }

   dfs1(1, 1, 1 ,0);
   dfs2(1, 1);
   build(1, 1, n);

   scanf("%d", &m);
   while (m--)
   {
   	char cmd[20];
   	scanf("%s", cmd);

   	if (cmd[0] == 'C')
   	{
   		int x, c;
   		scanf("%d%d", &x, &c);
   		int u = rec[x].u, v = rec[x].v;

   		change1(1, dep[v] > dep[u] ? id[v] : id[u], c);
   	}
   	else if (cmd[0] == 'N')
   	{
   		int u, v;
   		scanf("%d%d", &u, &v);
   		u++, v++;

   		int k = LCA(u, v);

   		while (top[u] != top[v])
   		{
   			if (dep[top[v]] < dep[top[u]]) swap(u, v);
   			change2(1, id[top[v]], id[v]);
   			v = fa[top[v]];
   		}
   		if (id[u] > id[v]) swap(u, v);
   		change2(1, id[u], id[v]);
   		change2(1, id[k], id[k]);
   	}
   	else if (cmd[0] == 'S')
   	{
   		int u, v;
   		scanf("%d%d", &u, &v);
   		u++, v++;

   		int k = LCA(u, v), ans = 0;

   		while (top[u] != top[v])
   		{
   			if (dep[top[v]] < dep[top[u]]) swap(u, v);
   			ans += ask_sum(1, id[top[v]], id[v]);
   			v = fa[top[v]];
   		}
   		if (id[u] > id[v]) swap(u, v);
   		printf("%d\n", ans + ask_sum(1, id[u], id[v]) - ask_sum(1, id[k], id[k]));
   	}
   	else if (cmd[0] == 'M')
   	{
   		if (cmd[1] == 'I')
   		{
   			int u, v;
   			scanf("%d%d", &u, &v);
   			u++, v++;

   			int k = LCA(u, v), ans = 1e9;
   			int bef = ask_min(1, id[k], id[k]);
   			change1(1, id[k], 1e9);

   			while (top[u] != top[v])
   			{
   				if (dep[top[v]] < dep[top[u]]) swap(u, v);
   				ans = min(ans, ask_min(1, id[top[v]], id[v]));
   				v = fa[top[v]];
   			}
   			if (id[u] > id[v]) swap(u, v);
   			printf("%d\n", min(ans, ask_min(1, id[u], id[v])));
   			change1(1, id[k], bef);
   		}
   		else if (cmd[1] == 'A')
   		{
   			int u, v;
   			scanf("%d%d", &u, &v);
   			u++, v++;

   			int k = LCA(u, v), ans = -1e9;
   			int bef = ask_max(1, id[k], id[k]);
   			change1(1, id[k], -1e9);

   			while (top[u] != top[v])
   			{
   				if (dep[top[v]] < dep[top[u]]) swap(u, v);
   				ans = max(ans, ask_max(1, id[top[v]], id[v]));
   				v = fa[top[v]];
   			}
   			if (id[u] > id[v]) swap(u, v);
   			printf("%d\n", max(ans, ask_max(1, id[u], id[v])));
   			change1(1, id[k], bef);
   		}
   	}
   }
}

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

---

双倍经验

• 无