弦图好神奇
详细看《弦图与区间图-陈丹琦》:http://wenku.baidu.com/link?url=H7Jlvsd5OfkTMgLhVneYZrkQCBC7IW5ruDjY7m2rPY94nJ1wur6fQfPCcyme2cA7jbE1fEN4Tps2CQXm9sOuW9XC6batJNTEMYw5LXNxheu
Orz
反正弦图的很多操作都是在完美消除序列上做的
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define V G[p].v
using namespace std;
inline char nc()
{
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(int &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int N=10005;
const int M=5000005;
struct edge{
int u,v,next;
};
edge G[M];
int head[N<<1],inum;
inline void add(int u,int v,int p){
G[p].u=u; G[p].v=v; G[p].next=head[u]; head[u]=p;
}
#define F(x) (x+1+n)
int n,m,ans;
int seq[N],vst[N],f[N],best;
int mark[N],clr[N];
inline void MCS(){
int v;
for (int i=1;i<=n;i++)
add(F(0),i,++inum);
for (int i=n;i;i--)
{
while (1){
v=0;
for (int p=head[F(best)];p && !v;p=G[p].next)
{
if (!vst[V])
v=V;
else
head[F(best)]=G[p].next;
}
if (v){
vst[v]=1; seq[i]=v;
for (int p=head[v];p;p=G[p].next)
if (!vst[V])
{
f[V]++;
add(F(f[V]),V,++inum);
best=max(best,f[V]);
}
break;
}
else
best--;
}
}
}
int main()
{
int iu,iv,x;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
read(n); read(m);
for (int i=1;i<=m;i++)
read(iu),read(iv),add(iu,iv,++inum),add(iv,iu,++inum);
MCS();
for (int i=n;i;i--)
{
x=seq[i];
for (int p=head[x];p;p=G[p].next)
mark[clr[V]]=i;
for (clr[x]=1;clr[x]<=n && mark[clr[x]]==i;clr[x]++);
ans=max(ans,clr[x]);
}
printf("%d\n",ans);
return 0;
}