链接 C. Linova and Kingdom
题意
有 n 个城市,n - 1 条路,编号从 1 - n 挑选 k 个城市作为工业城市,其他城市为旅游城市,现在要每个工业城市出一个人,按最短路径走到 1 号城市,途中每经过一个旅游城市幸福感 + 1;
求最大的幸福感;
思路
由题意可知道为树形结构,肯定要选深度更深的叶子节点;
当选了叶子节点的父节点,叶子节点的贡献就会 - 1,所以转化为让父节点贡献 - 1;
所以可知,每个节点的幸福感 = 深度 - 子树大小 + 1;
然后进行dfs就可;
AC代码
#include <bits/stdc++.h>
#define hz020 return
#define mes memset
#define mec memcpy
#define x first
#define y second
#define pb push_back
#define be(x) (x).begin(), (x).end()
#define cl(x) memset((x), 0, sizeof (x))
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll,ll> PII;
const double pi = acos(-1);
const int N = 200010;
const int null = 0x3f3f3f3f,INF = 1e9;
const ll mod = 998244353;
int T;
int n, k;
int e[N * 2], h[N], ne[N * 2], idx;
ll dist[N], ssize[N];
ll ans[N];
void add(ll a, ll b) {e[idx] = b, ne[idx] = h[a], h[a] = idx ++;}
void dfs(int u, int v)
{
dist[u] = dist[v] + 1;
ssize[u] = 1;
for (int i = h[u]; i != -1; i = ne[i])
{
int j = e[i];
if (j == v) continue;
dfs(j, u);
ssize[u] += ssize[j];
}
ans[u] = dist[u] - ssize[u] + 1;
}
bool cmp(int x, int y) {return x > y;}
void solve()
{
mes(h, -1, sizeof h);
cin >> n >> k;
ll res = 0;
for (int i = 1; i < n; i ++)
{
int x, y;
cin >> x >> y;
add(x, y), add(y, x);
}
dist[1] = -1;
dfs(1, 1);
sort(ans + 1, ans + 1 + n, cmp);
for (int i = 1; i <= k; i ++) res += ans[i];
cout << res << endl;
}
int main()
{
solve();
hz020 0;
}