这个证明我真的不会啊……
Vfleaking证明传送门
Dilworth定理:最小链覆盖数 = 最长反链长度。
其对偶定理:最长链长度 = 最小反链覆盖数。
知道这个定理后,先floyd求出点对间的关系再跑dinic就好了。
#include<iostream>
#include<cstdio>
#include<cstring>
#define inf 1000000007
#define N 500
using namespace std;
int n,m,T,ans,cnt=1,a[N>>1][N>>1],dis[N],q[N],head[N];
int next[N*N],list[N*N],key[N*N];
inline int read()
{
int a=0,f=1; char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}
while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}
return a*f;
}
inline void insert(int x,int y,int z)
{
next[++cnt]=head[x];
head[x]=cnt;
list[cnt]=y;
key[cnt]=z;
}
inline void floyd()
{
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
a[i][j]|=(a[i][k]&a[k][j]);
}
inline bool BFS()
{
memset(dis,-1,sizeof(dis));
dis[0]=1; q[1]=0;
int t=0,w=1,x;
while (t!=w)
{
x=q[++t];
for (int i=head[x];i;i=next[i])
if (key[i]&&dis[list[i]]==-1)
dis[list[i]]=dis[x]+1,q[++w]=list[i];
}
return dis[T]!=-1;
}
int find(int x,int flow)
{
if (x==T) return flow;
int w,used=0;
for (int i=head[x];i;i=next[i])
if (key[i]&&dis[list[i]]==dis[x]+1)
{
w=find(list[i],min(key[i],flow-used));
key[i]-=w; key[i^1]+=w; used+=w;
if (used==flow) return flow;
}
if (!used) dis[x]=-1;
return used;
}
inline void build()
{
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (a[i][j]) insert(i,j+n,inf),insert(j+n,i,0);
for (int i=1;i<=n;i++)
insert(0,i,1),insert(i,0,0),insert(i+n,T,1),insert(T,i+n,0);
}
int main()
{
n=read(); m=read(); T=2*n+1;
for (int i=1;i<=m;i++)
{
int u=read(),v=read();
a[u][v]=1;
}
floyd();
build();
while (BFS()) ans+=find(0,inf);
cout << n-ans;
return 0;
}