二叉苹果树~~~
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define bug(x) cout<<#x<<"=="<<x<<endl;
const ll maxn=1e5+10;
struct node
{
int to,next;
int w;
}edge[maxn*2];
int head[maxn] = { 0 };
int tot=0;
inline void add_edge(int u,int v,int w)
{
tot++;
edge[tot].to = v;
edge[tot].w = w;
edge[tot].next = head[u];
head[u] = tot;
}
int f[105][105];
int siz[maxn];
int n,q;
void dfs(int u,int fu)
{
for(int i=head[u];~i;i=edge[i].next)
{
int v=edge[i].to;
if(v!=fu)
{
bug(v);
dfs(v,u);
siz[u]+=siz[v]+1;
///这个是代表现在u这个结点向上有多少个边(树枝)
for(int j=min(siz[u],q);j>=1;j--)
{
for(int k=min(siz[v],j-1);k>=0;k--)///k代表另一条子树的边数大小
{
f[u][j]=max(f[u][j],f[u][j-k-1]+f[v][k]+edge[i].w);
///j-k-1条边和k条边相连需要一条边 这样子一共j条边
}
}
}
}
}
int main()
{
scanf("%d %d",&n,&q);
memset(head,-1,sizeof(head));
for(int i=1;i<n;i++)
{
int u,v,w;
scanf("%d %d %d",&u,&v,&w);
add_edge(u,v,w);
add_edge(v,u,w);
}
dfs(1,0);
printf("%d\n",f[1][q]);
}
求深度的模板题
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define bug(x) cout<<#x<<"=="<<x<<endl;
const ll maxn=1e5+10;
struct node
{
int to,next;
int w;
}edge[maxn*2];
int head[maxn] = { 0 };
int tot=0;
inline void add_edge(int u,int v)
{
tot++;
edge[tot].to = v;
///edge[tot].w = w;
edge[tot].next = head[u];
head[u] = tot;
}
int siz[maxn] = { 0 };
ll f[maxn] = { 0 };
ll deep[maxn] = { 0 };//1为根结点的时候,所有子结点到目前结点的距离
int n,q;
void dfs(int u,int fu)
{
siz[u] = 1;
deep[u] = deep[fu]+1;
for(int i=head[u];~i;i=edge[i].next)
{
int v=edge[i].to;
if(v!=fu)
{
dfs(v,u);
siz[u] += siz[v];
}
}
}
void dfs2(int u,int fu)
{
for(int i=head[u];~i;i=edge[i].next)
{
int v=edge[i].to;
if(v!=fu)
{
f[v]=f[u]+n-2*siz[v];
bug(v);
bug(f[v]);
dfs2(v,u);
///每一个子结点变成树的时候就是上一个结点距离该子树里面的结点都减1,上一个结点的其他子树上的结点都+1;
}
}
}
int main()
{
scanf("%d",&n);
memset(head,-1,sizeof(head));
for(int i=1;i<n;i++)
{
int u,v,w;
scanf("%d %d",&u,&v);
add_edge(u,v);
add_edge(v,u);
}
dfs(1,0);
for(int i=1;i<=n;i++)f[1]+=deep[i];
///bug(f[1]);
dfs2(1,0);
ll ans=f[1];
int index=1;
for(int i=2;i<=n;i++)
{
if(f[i]>ans)
{
ans=f[i];
index=i;
}
}
printf("%d\n",index);
}
类似于树的深度的题目(进阶版)
链接:传送门
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define bug(x) cout<<#x<<"=="<<x<<endl;
const int maxn=1e5+7;
ll c[maxn] = { 0 };
int head[maxn] = { 0 };
ll dis[maxn] = { 0 };
ll siz[maxn]={0};///每一个子树中牛的数目
ll dp[maxn]={0};
ll ans=0;
ll sum=0;
int tot=0;
struct node
{
int next,to;
ll w;
}e[maxn*2];
inline void add_edge(int u,int v,ll w)
{
tot++;
e[tot].to = v;
e[tot].next = head[u];
e[tot].w=w;
head[u] = tot;
}
ll dfs(int u,int fu)
{
ll tot=0;
for(int i=head[u];~i;i=e[i].next)
{
int v=e[i].to;
if(v!=fu)
{
ll cnt=dfs(v,u);
dis[u]+=dis[v]+e[i].w*cnt;
tot+=cnt;
}
}
return siz[u]=c[u]+tot;
}
void dfs2(int u,int fu)
{
for(int i=head[u];~i;i=e[i].next)
{
int v=e[i].to;
ll w=e[i].w;
if(v!=fu)
{
dp[v]=dp[u]-siz[v]*w+(sum-siz[v])*w;
dfs2(v,u);
}
}
}
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&c[i]);
head[i]=-1;
sum+=c[i];
}
for(int i=1;i<n;i++)
{
int u,v;
ll w;
scanf("%d %d %lld",&u,&v,&w);
add_edge(u,v,w);
add_edge(v,u,w);
}
dfs(1,0);
dp[1]=dis[1];
dfs2(1,0);
ll ans=dp[1];
for(int i=1;i<=n;i++)
{
ans=min(dp[i],ans);
}
printf("%lld\n",ans);
}
巧思与Dp
https://codeforces.com/problemset/problem/1566/E
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=2e5+7;
int tot=0;
int head[maxn] = { 0 };
ll ans=0;
struct node
{
int next,to;
} e[maxn*2];
inline void add_edge(int u,int v)
{
tot++;
e[tot].next=head[u];
e[tot].to=v;
head[u]=tot;
}
int dfs(int u,int fu)
{
int now=0;
for(int i=head[u];~i;i=e[i].next)
{
int v=e[i].to;
if(v!=fu)
{
now += dfs(v,u);
}
}
if(now==0)
{
return 1;///叶子结点
}
else
{
ans += now-1;
return 0;///相当于把该树移动走了
}
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
for(int i=1; i<=n; i++)
{
head[i]=-1;
}
int u,v;
tot=0;
ans=0;
for(int i=1; i<n; i++)
{
scanf("%d %d",&u,&v);
add_edge(u,v);
add_edge(v,u);
}
dfs(1,0);
printf("%lld\n",ans+1);
}
}