树形DP板子题:
树的直径和距离:
1072. 树的最长路径
直径:
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=2e5+10;
int ne[N],h[N];
int e[N],idx;
int w[N];
int ans;
int dfs(int u,int father)
{
int dist=0;
int d1=0;int d2=0;
for(int i=h[u];i!=-1;i=ne[i])
{
int j=e[i];
if(j==father) continue;
int d=dfs(j,u)+w[i];//每一个子树的尺寸
dist=max(d,dist); //求子树的最大值用于Return
if(d>d1) d2=d1,d1=d;//对每一个子树求最长和次长尺寸
else if(d>d2) d2=d;
}
ans=max(ans,d1+d2);//全局找最长路径
return dist;
}
void add(int a,int b,int c)
{
e[idx]=b,w[idx]=c,ne[idx]=h[a],h[a]=idx++;
}
int n;
int main()
{
memset(h,-1,sizeof h);
cin>>n;
for(int i=1;i<n;i++)
{
int a,b,c;
cin>>a>>b>>c;
add(a,b,c);
add(b,a,c);
}
dfs(1,0);
cout<<ans<<endl;
}
1073. 树的中心
树上两点最大距离:
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 4e5 + 10;
int ne[N] , w[N] , e[N] , h[N] , idx , ans = 0x3f3f3f3f;
int dist[N][3] , n , up[N];
void add(int a, int b , int c)
{
e[idx] = b , ne[idx] = h[a] , w[idx] = c , h[a] = idx ++;
}
int dfs1(int u , int father)
{
int d1 = 0 , d2 = 0;
for(int i = h[u] ; ~ i ; i = ne[i])
{
int j = e[i];
if(j == father) continue;
int now = dfs1(j , u) + w[i];
if(now > d1)
{
d2 = d1;
d1 = now;
}
else if(now > d2)
{
d2 = now;
}
}
dist[u][1] = d1 , dist[u][2] = d2;
return dist[u][1];
}
void dfs2(int u , int father)
{
for(int i = h[u] ; ~ i ; i = ne[i])
{
int j = e[i];
if(j == father) continue;
up[j] = up[u] + w[i];
if(dist[u][1] == dist[j][1] + w[i])
{
up[j] = max(up[j] , dist[u][2] + w[i]);
}
else
{
up[j] = max(up[j] , dist[u][1] + w[i]);
}
dfs2(j , u);
}
}
signed main()
{
memset(h , -1 , sizeof h);
cin >> n;
for(int i = 1 ; i <= n - 1 ; i ++)
{
int a , b , c;
scanf("%lld %lld %lld" , &a , &b , &c);
add(a , b , c) , add(b , a , c);
}
dfs1(1 , -1);
dfs2(1 , -1);
for(int i = 1 ; i <= n ; i ++)
{
ans = min(ans , max({dist[i][1] , up[i]}));
}
printf("%lld\n" , ans);
}
1075. 数字转换
用约束建边,本质还是求树上的直径。
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 2*50010, M = N;
int n;
int h[N], e[M], w[M], ne[M], idx;
int sum[N];
bool st[N];
int ans;
void add(int a, int b) { e[idx] = b, ne[idx] = h[a], h[a] = idx++; }
int dfs(int u, int father) //求树的直径
{
st[u] = true;
int dist = 0;
int d1 = 0, d2 = 0;
for (int i = h[u]; i != -1; i = ne[i]) {
int j = e[i];
if (j == father) continue;
if (!st[j]) {
int d = dfs(j, u) + 1;
dist = max(dist, d);
if (d >= d1)
d2 = d1, d1 = d;
else if (d > d2)
d2 = d;
}
}
ans = max(ans, d1 + d2);
return dist;
}
int main() {
cin >> n;
memset(h, -1, sizeof h);
for (int i = 1; i <= n; i++)
for (int j = 2; j <= n / i; j++) //筛法求一个数的所有约数和
sum[i * j] += i;
for (int i = 2; i <= n; i++)
if (sum[i] < i) {
add(sum[i], i); //自己的约数和向自己连一条边
add(i, sum[i]);
}
dfs(1, -1);
cout << ans << endl;
return 0;
}
二叉苹果树
树上背包板子。
#include<bits/stdc++.h>
#define int long long
const int N = 110;
using namespace std;
int f[N][N * N] , n , m , ne[N * 2] , e[N * N] , h[N * 2] , w[N * N] , idx , siz[N * N];
void add(int a , int b , int c)
{
e[idx] = b , ne[idx] = h[a] , w[idx] = c , h[a] = idx ++;
}
void dfs(int u , int father)
{
f[u][0] = 0;
for(int i = h[u] ; ~ i ; i = ne[i])
{
int j = e[i];
if(j == father) continue;
dfs(j , u);
siz[u] += 1;
for(int k = siz[u]; k >= 0 ; k --)
{
for(int z = siz[j] ; z >= 0 ; z --)
{
f[u][k + z] = max(f[u][k + z] , f[u][k - 1] + f[j][z] + w[i]);
}
}
siz[u] = (siz[u] + siz[j]);
}
}
signed main()
{
cin >> n >> m;
memset(h , -1 , sizeof h);
memset(f , -0x3f , sizeof f);
for(int i = 1 ; i < n ; i ++)
{
int a , b , c;
scanf("%lld %lld %lld" , &a , &b , &c);
add(a , b , c);
add(b , a , c);
}
dfs(1 , -1);
cout << f[1][m] << endl;
}
P1352 没有上司的舞会
最大独立集。
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+10;
int n,ans,f[N][3];
int ne[N],e[N],w[N],h[N],idx;
int has_root[N];
void add(int a,int b)
{
e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}
void dfs(int x)
{
f[x][1]=w[x];
for(int i=h[x];i!=-1;i=ne[i])
{
int j=e[i];
dfs(j);
f[x][1]+=f[j][0];
f[x][0]=f[x][0]+max(f[j][1],f[j][0]);
}
}
signed main()
{
memset(h,-1,sizeof h);
cin>>n;
for(int i=1;i<=n;i++) cin>>w[i];
for(int i=1;i<=n-1;i++)
{
int l,k;
cin>>l>>k;
has_root[l]=1;
add(k,l);
}
int root=1;
while(has_root[root]) root++;
dfs(root);
cout<<max(f[root][0],f[root][1])<<endl;
}
最小点覆盖
选最少的点覆盖所有的边。
323. 战略游戏
#include<bits/stdc++.h>
using namespace std;
const int N=1510;
int dp[N][3],st[N],n;
int ne[N],e[N],h[N],idx;
void add(int a, int b) // 添加一条边a->b
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
int dfs(int x)
{
dp[x][1]=1;
for(int i=h[x];i!=-1;i=ne[i])
{
int j=e[i];
dfs(j);
dp[x][0]+=dp[j][1];
dp[x][1]+=min(dp[j][0],dp[j][1]);
}
}
int main()
{
while(cin>>n)
{
idx=0;
memset(h,-1,sizeof h);
memset(dp,0,sizeof dp);
memset(st,0,sizeof st);
int a,cnt;
for(int i=1;i<=n;i++)
{
scanf("%d:(%d)",&a,&cnt);
while(cnt--)
{
int x;
cin>>x;
add(a,x);
st[x]=true;
}
}
int root=0;
while(st[root]) root++;
dfs(root);
printf("%d\n",min(dp[root][1],dp[root][0]));
}
}
最小支配集
1077. 皇宫看守
选出最少的点 , 使得每个点要么被选 、要么被它的相邻点支配。
#include<bits/stdc++.h>
#define int long long
const int N = 3010;
using namespace std;
int ne[N] , e[N] , h[N] , w[N] , idx;
int f[N][5] , siz[N] , n;
void add(int a , int b)
{
e[idx] = b , ne[idx] = h[a] , h[a] = idx ++;
}
void dfs(int u , int father)
{
int sum = 0 ,flag = 0;
f[u][0] = w[u];
// cout <<" u = " << u <<" w_u = " << w[u] << endl;
for(int i = h[u] ; ~ i ; i = ne[i])
{
int j = e[i];
if(j == father) continue;
flag = 1;
dfs(j , u);
sum += min(f[j][0] , f[j][2]);
f[u][0] += min({f[j][0] , f[j][1] , f[j][2]});
}
f[u][1] = sum;
for(int i = h[u] ; ~ i ; i = ne[i])
{
int j = e[i];
if(j == father) continue;
f[u][2] = min(f[u][2] , f[j][0] + sum - min({f[j][0] , f[j][2]}));
}
if(!flag) f[u][1] = 0;
}
signed main()
{
cin >> n;
memset(h , -1 , sizeof h);
memset(f , 0x3f , sizeof f);
for(int i = 1 ; i <= n ; i ++)
{
int x , k , r;
scanf("%lld" , &x);
scanf("%lld" , &w[x]);
scanf("%lld" , &k);
while(k --)
{
scanf("%lld" , &r);
add(x , r);
add(r , x);
}
}
dfs(1 , -1);
printf("%lld\n" , min({f[1][0] , f[1][2]}));
}
/*
6
1 30 3 2 3 4
2 16 2 5 6
3 5 0
4 4 0
5 11 0
6 5 0
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e6+10;
int ne[N],e[N],h[N],w[N],idx;
int siz[N],ans,n;
void add(int a,int b,int c)
{
e[idx]=b,ne[idx]=h[a],w[idx]=c,h[a]=idx++;
}
int dfs(int u,int father)
{
siz[u]=1;
for(int i=h[u];~i;i=ne[i])
{
int j=e[i];
if(j==father) continue;
dfs(j,u);
siz[u]+=siz[j];
ans+=abs(n-2*siz[j])*w[i];
}
}
signed main()
{
memset(h, -1, sizeof h);
cin>>n;
for(int i=1;i<=n-1;i++)
{
int a,b,c;
cin>>a>>b>>c;
add(a,b,c);
add(b,a,c);
}
dfs(1,-1);
cout<<ans<<endl;
}