BZOJ 1023: [SHOI2008]cactus仙人掌图 | 在仙人掌上跑DP

题目:

求仙人掌直径

http://www.lydsy.com/JudgeOnline/problem.php?id=1023

---

题解:

首先给出仙人掌的定义:满足所有的边至多在一个环上的无向联通图

我们先考虑一下如何求一棵树的直径

1.维护以每个节点的为根的子树中,以根为一条路径端点的最长路和次长路,

#include<cstdio>
#include<algorithm>
#include<cstring>
#define N 50005
using namespace std;
inline int read()
{
    int ret=,neg=;char j=getchar();
    for (;j>'' || j<'';j=getchar()) if (j=='-') neg=-;
    for (;j>='' && j<='';j=getchar()) ret=ret*+j-'';
    return ret*neg;
}
int n,m,ecnt,ind,ans;
int head[N],deep[N],f[N],low[N],dfn[N],fa[N];
int a[*N],q[*N],l,r;
struct adj{int v,nxt;}e[*N];
void add(int u,int v)
{
    e[++ecnt].v=v;e[ecnt].nxt=head[u];head[u]=ecnt;
    e[++ecnt].v=u;e[ecnt].nxt=head[v];head[v]=ecnt;
}
void dp(int root,int x)
{
    int tot=deep[x]-deep[root]+;
    for (int i=x;i!=root;i=fa[i])
    a[tot--]=f[i];
    a[tot]=f[root];
    tot=deep[x]-deep[root]+;
    for (int i=;i<=tot;i++) a[i+tot]=a[i];
    q[]=;l=r=;
    for (int i=;i<=*tot;i++)
    {
    while (l<=r && i-q[l]>tot/) l++;
    ans=max(ans,a[i]+i+a[q[l]]-q[l]);
    while (l<=r && a[q[r]]-q[r]<=a[i]-i) r--;
    q[++r]=i;
    }
    for (int i=;i<=tot;i++)
    f[root]=max(f[root],a[i]+min(i-,tot-i+));
}
void dfs(int x)
{
    low[x]=dfn[x]=++ind;
    for (int i=head[x],v;i;i=e[i].nxt)
    if (e[i].v!=fa[x])
    {
        if (!dfn[v=e[i].v])
        {
        fa[v]=x;deep[v]=deep[x]+;
        dfs(v);
        low[x]=min(low[x],low[v]);
        }
        else low[x]=min(low[x],dfn[v]);
        if (dfn[x]<low[v])
        ans=max(ans,f[x]+f[v]+),f[x]=max(f[x],f[v]+);
    }
    for (int i=head[x],v;i;i=e[i].nxt)
    if (fa[v=e[i].v]!=x && dfn[x]<dfn[v])
        dp(x,v);
}
int main()
{
    n=read();m=read();
    for (int i=;i<=m;i++)
    {
    int k=read(),x=read();
    for (int i=;i<=k;i++)
    {
        int y=read();add(x,y);x=y;
    }
    }
    dfs();
    printf("%d\n",ans);
    return ;
}