题目链接:Max Flow
题目大意:在一条树上给出k条路径,每条路径上所有点权+1,输出最大的点权
解法一:
树链剖分:O(nloglogn)直接上板子就好了,后期我会发一下树链剖分详解的博客;
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#define lson root<<1,left,mid
#define rson root<<1|1,mid+1,right
#define Root int root,int left,int right
const int MAXN=6000000;
using namespace std;
struct Tree
{
int Max,Tag;
}segTree[MAXN<<1];
struct Edge
{
int next,to;
}edge[MAXN<<1];
int vis[MAXN],head[MAXN],n,m,deep[MAXN],num[MAXN],cnt,Num_Tree,son[MAXN],fa[MAXN],top[MAXN],id[MAXN];
inline int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
x=x*10+ch-'0';
ch=getchar();
}
return x*f;
}
inline void Add_Edge(int u,int v)
{
edge[++cnt].to=v;
edge[cnt].next=head[u];
head[u]=cnt;
}
void Dfs1(int u,int step)
{
vis[u]=1;
num[u]=1;
deep[u]=step;
for(register int i=head[u];i;i=edge[i].next)
{
int v=edge[i].to;
if(vis[v]==0)
{
fa[v]=u;
Dfs1(v,step+1);
num[u]+=num[v];
if(son[u]==0||num[v]>num[son[u]]) son[u]=v;
}
}
}
void Dfs2(int u,int topf)
{
top[u]=topf;
vis[u]=1;
id[u]=++Num_Tree;
if(son[u]==0) return ;
if(vis[son[u]]==0) Dfs2(son[u],topf);
for(register int i=head[u];i;i=edge[i].next)
{
int v=edge[i].to;
if(vis[v]==0&&v!=son[u]&&v!=fa[u]) Dfs2(v,v);
}
return ;
}
void Built(Root)
{
if(left==right)
{
segTree[root].Max=0;
return ;
}
int mid=(left+right)>>1;
Built(lson);
Built(rson);
segTree[root].Max=max(segTree[root<<1].Max,segTree[root<<1|1].Max);
return ;
}
void PushDown(Root)
{
if(segTree[root].Tag==0) return ;
else
{
int mid=(left+right)>>1;
segTree[root<<1].Tag+=segTree[root].Tag;
segTree[root<<1|1].Tag+=segTree[root].Tag;
segTree[root<<1].Max+=segTree[root].Tag;
segTree[root<<1|1].Max+=segTree[root].Tag;
segTree[root].Max=max(segTree[root<<1].Max,segTree[root<<1|1].Max);
segTree[root].Tag=0;
return ;
}
return ;
}
void Change(Root,int qleft,int qright)
{
PushDown(root,left,right);
if(left>qright||right<qleft) return ;
if(left>=qleft&&right<=qright)
{
segTree[root].Max+=1;
segTree[root].Tag+=1;
// segTree[root/2].Max=max(segTree[(root/2)<<1].Max,segTree[(root/2)<<1|1].Max);
return ;
}
PushDown(root,left,right);
int mid=(left+right)>>1;
Change(lson,qleft,qright);
Change(rson,qleft,qright);
segTree[root].Max=max(segTree[root<<1].Max,segTree[root<<1|1].Max);
return ;
}
void Cp(int x,int y)
{
while(top[x]!=top[y])
{
if(deep[top[x]]<deep[top[y]]) swap(x,y);
Change(1,1,n,id[top[x]],id[x]);
x=fa[top[x]];
}
if(deep[x]>deep[y]) swap(x,y);
Change(1,1,n,id[x],id[y]);
return ;
}
int main()
{
n=read(),m=read();
for(register int i=1;i<=n-1;i++)
{
int x,y;
x=read(),y=read();
Add_Edge(x,y);
Add_Edge(y,x);
}
Dfs1(1,0);
memset(vis,0,sizeof(vis));
Dfs2(1,1);
Built(1,1,n);
for(register int i=1;i<=m;i++)
{
int x,y;
x=read(),y=read();
Cp(x,y);
}
printf("%d",segTree[1].Max);
return 0;
}
解法二:
树上差分:我们把u->v路径上的点权+1,维护差分数组sum[],令sum[u]++,sum[v]++,sum[LCA(u,v)]--,sum[fa[LCA(u,v)]]--;
最后Dfs_difference就可以;
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<cstring>
const int MAXN=6000000;
using namespace std;
struct Edge
{
int next,to;
}edge[MAXN];
int cnt,head[MAXN],fa[MAXN],ans,sum[MAXN],s[MAXN],deep[MAXN],vis[MAXN],num[MAXN],top[MAXN],son[MAXN],q,n;
void Add_Edge(int u,int v)
{
edge[++cnt]=(Edge){head[u],v};
head[u]=cnt;
}
void Dfs_1(int u,int step)
{
vis[u]=1;
deep[u]=step;
num[u]=1;
for(register int i=head[u];i;i=edge[i].next)
{
int v=edge[i].to;
if(vis[v]==0)
{
fa[v]=u;
Dfs_1(v,step+1);
num[u]+=num[v];
if(son[u]==0||num[son[u]<num[v]]) son[u]=v;
}
}
return ;
}
void Dfs_2(int u,int topf)
{
vis[u]=1;
top[u]=topf;
if(son[u]==0) return ;
if(vis[son[u]]==0) Dfs_2(son[u],topf);
for(register int i=head[u];i;i=edge[i].next)
{
int v=edge[i].to;
if(vis[v]==0&&v!=fa[u]&&v!=son[u]) Dfs_2(v,v);
}
return ;
}
int LCA(int x,int y)//树链剖分求LCA,不会的可以用倍增
{
while(top[x]!=top[y])
{
if(deep[top[x]]>deep[top[y]]) x=fa[top[x]];
else y=fa[top[y]];
}
return deep[x]<deep[y]?x:y;
}
void Dfs_difference(int u)
{
vis[u]=1;
for( int i=head[u];i;i=edge[i].next)
{
int v=edge[i].to;
if(vis[v]==0)
{
Dfs_difference(v);
sum[u]+=sum[v];
}
}
ans=max(ans,sum[u]);
}
int main()
{
scanf("%d%d",&n,&q);
for(register int i=1;i<=n-1;i++)
{
int x,y;
scanf("%d%d",&x,&y);
Add_Edge(x,y);
Add_Edge(y,x);
} //49858
Dfs_1(1,0);
memset(vis,0,sizeof(vis));
Dfs_2(1,1);
for(register int i=1;i<=q;i++)
{
int x,y;
scanf("%d%d",&x,&y);
sum[x]++;
sum[y]++;
int a=LCA(x,y);
// cout<<a<<"<<<"<<" ";
sum[a]--;
sum[fa[a]]--;
}
//for(int i=1;i<=n;i++) cout<<sum[i]<<"<<<<<"<<"
memset(vis,0,sizeof(vis));
Dfs_difference(1);
printf("%d",ans);
return 0;
}