题意:
给出一棵 n n n 个节点的树,根节点为 1 1 1 号节点,每个点有一个价值 w i w_i wi
要求选出 k k k 条从 1 1 1 号节点到叶子的路径,使得这些路径并的价值和最大
1 ≤ n , k ≤ 2 ∗ 1 0 5 , 1 ≤ w i ≤ 1 0 9 1 \le n,k \le 2*10^5,1 \le w_i \le 10^9 1≤n,k≤2∗105,1≤wi≤109
首先每次贪心取显然正确
那么我们处理出 d f s dfs dfs 序
对于 d f s dfs dfs 序建立线段树,每个节点存储该节点到根的剩余价值(没被去过的)
然后选取 k k k 次,每次把最大值取出来后就把路径上没去过的点取了(子树减)
如果 x x x 被取了,那么 x x x 的祖先一定也被取,这样保证每个点只被取 1 1 1 次
时间复杂度 O ( ( n + k ) l o g n ) O((n+k)~log~n) O((n+k) log n)
#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std ;
#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(x) freopen(#x".in", "r", stdin),freopen(#x".out", "w", stdout)
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair <int, int> pii ;
typedef vector <int> vi ;
typedef vector <pii> vii ;
typedef queue <int> qi ;
typedef queue <pii> qii ;
typedef set <int> si ;
typedef map <int, int> mii ;
typedef map <string, int> msi ;
const int N = 200010 ;
const int INF = 0x3f3f3f3f ;
const int iinf = 1 << 30 ;
const ll linf = 2e18 ;
const int MOD = 1000000007 ;
const double eps = 1e-7 ;
void print(int x) { cout << x << endl ; exit(0) ; }
void PRINT(string x) { cout << x << endl ; exit(0) ; }
void douout(double x){ printf("%lf\n", x + 0.0000000001) ; }
int n, m, sz, ans ;
int sum[N], val[N], l[N], r[N], pos[N], f[N], vis[N] ;
vi e[N] ;
void dfs(int x, int fa) {
sum[x] = sum[fa] + val[x] ;
bool flag = false ;
rep(i, 0, siz(e[x]) - 1) {
int to = e[x][i] ;
if (to == fa) continue ;
flag = true ;
}
if (!flag) {
l[x] = r[x] = ++sz ;
pos[sz] = x ;
return ;
}
l[x] = sz + 1 ;
rep(i, 0, siz(e[x]) - 1) {
int to = e[x][i] ;
if (to == fa) continue ;
f[to] = x ;
dfs(to, x) ;
}
r[x] = sz ;
}
struct SegTree {
int l, r, v, tag, del ;
#define l(x) tr[x].l
#define r(x) tr[x].r
#define ls(x) x << 1
#define rs(x) x << 1 | 1
#define v(x) tr[x].v
#define tag(x) tr[x].tag
#define del(x) tr[x].del
} tr[N << 2] ;
void pushup(int x) {
if (v(ls(x)) > v(rs(x))) v(x) = v(ls(x)), tag(x) = tag(ls(x)) ;
else v(x) = v(rs(x)), tag(x) = tag(rs(x)) ;
}
void pushdown(int x) {
if (del(x)) {
v(ls(x)) += del(x) ; del(ls(x)) += del(x) ;
v(rs(x)) += del(x) ; del(rs(x)) += del(x) ;
del(x) = 0 ;
}
}
void build(int x, int l, int r) {
l(x) = l, r(x) = r ;
if (l == r) {
v(x) = sum[pos[l]] ;
tag(x) = pos[l] ;
return ;
}
int mid = (l + r) >> 1 ;
build(ls(x), l, mid) ;
build(rs(x), mid + 1, r) ;
pushup(x) ;
}
void modify(int x, int l, int r, int v) {
if (l <= l(x) && r(x) <= r) {
v(x) -= v ;
del(x) -= v ;
return ;
}
int mid = (l(x) + r(x)) >> 1 ;
pushdown(x) ;
if (l <= mid) modify(ls(x), l, r, v) ;
if (mid < r) modify(rs(x), l, r, v) ;
pushup(x) ;
}
void solve(int x) {
while (x) {
if (vis[x]) break ;
vis[x] = 1 ;
modify(1, l[x], r[x], val[x]) ;
x = f[x] ;
}
}
signed main(){
scanf("%lld%lld", &n, &m) ;
rep(i, 1, n) scanf("%lld", &val[i]) ;
rep(i, 1, n - 1) {
int x, y ; scanf("%lld%lld", &x, &y) ;
e[x].pb(y) ; e[y].pb(x) ;
}
dfs(1, 0) ;
build(1, 1, sz) ;
while (m--) {
ans += v(1) ;
solve(tag(1)) ;
}
printf("%lld\n", ans) ;
return 0 ;
}
/*
写代码时请注意:
1.ll?数组大小,边界?数据范围?
2.精度?
3.特判?
4.至少做一些
思考提醒:
1.最大值最小->二分?
2.可以贪心么?不行dp可以么
3.可以优化么
4.维护区间用什么数据结构?
5.统计方案是用dp?模了么?
6.逆向思维?
*/