真神orz
跪题解:portal
有关仙人掌的更多内容,欢迎参见wys2015年的集训队论文~
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 50010
#define M 100010
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,m,h[N],num=0,ans=0,fa[N],dfn[N],low[N],f[N],dep[N],dfnum=0;
int a[N<<1],q[N<<1];
struct edge{
int to,next;
}data[M<<1];
inline void add(int x,int y){
data[++num].to=y;data[num].next=h[x];h[x]=num;
data[++num].to=x;data[num].next=h[y];h[y]=num;
}
inline void dp(int rt,int x){
int tot=dep[x]-dep[rt]+1;a[tot]=f[x];
for(int xx=x;xx!=rt;xx=fa[xx]) a[--tot]=f[fa[xx]];tot=dep[x]-dep[rt]+1;
for(int i=1;i<=tot;++i) a[tot+i]=a[i];
int qh=1,qt=0;q[++qt]=1;
for(int i=2;i<=tot*2;++i){
while(qh<=qt&&i-q[qh]>tot/2) ++qh;
ans=max(ans,a[i]+i+a[q[qh]]-q[qh]);
while(qh<=qt&&a[q[qt]]-q[qt]<=a[i]-i) --qt;
q[++qt]=i;
}for(int i=2;i<=tot;++i)
f[rt]=max(f[rt],a[i]+min(i-1,tot-i+1));
}
int dfs(int x){
dfn[x]=low[x]=++dfnum;
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(y==fa[x]) continue;
if(!dfn[y]){fa[y]=x;dep[y]=dep[x]+1;dfs(y);low[x]=min(low[x],low[y]);}
else low[x]=min(low[x],dfn[y]);
if(dfn[x]<low[y]){//y和x不在一个环上
ans=max(ans,f[x]+f[y]+1);
f[x]=max(f[x],f[y]+1);
}
}for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(fa[y]!=x&&dfn[y]>dfn[x]) dp(x,y);
}
}
int main(){
// freopen("a.in","r",stdin);
n=read();m=read();
while(m--){
int owo=read(),x=read();owo--;
while(owo--){int y=read();add(x,y);x=y;}
}dfs(1);
printf("%d\n",ans);
return 0;
}