【LOJ6197】法克（最长反链）

传送门

---

老年选手复习最小链覆盖板子。

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register
#define gc get_char
#define cs const

namespace IO{
	inline char get_char(){
		static cs int Rlen=1<<22|1;
		static char buf[Rlen],*p1,*p2;
		return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
	}
	
	template<typename T>
	inline T get(){
		char c;
		while(!isdigit(c=gc()));T num=c^48;
		while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
		return num;
	}
	inline int getint(){return get<int>();}
}
using namespace IO;

using std::cerr;
using std::cout;

cs int INF=0x7fffffff;
cs int N=1e5+5;

int n,m;

int S,T;
namespace NetWork{
	cs int N=::N<<1;
	struct edge{
		int to,cap,rev;
		edge(int _to,int _cap,int _rev):to(_to),cap(_cap),rev(_rev){}
	};
	std::vector<edge> G[N];
	typedef std::vector<edge>::iterator iter;
	iter cur[N];
	
	inline void addedge(int u,int v,int val){
		G[u].push_back(edge(v,val,G[v].size()));
		G[v].push_back(edge(u,0,G[u].size()-1));
	}
	
	int lev[N],gap[N];
	inline void BFS(){
		memset(lev,0,sizeof lev);
		memset(gap,0,sizeof gap);
		gap[1]=lev[T]=1;std::queue<int> q;q.push(T);
		while(!q.empty()){
			int u=q.front();q.pop();cur[u]=G[u].begin();
			for(edge &e:G[u])if(lev[e.to]==0)++gap[lev[e.to]=lev[u]+1],q.push(e.to);
		}
	}
	
	bool finished;
	inline int dfs(int u,int flow){
		if(u==T)return flow;
		int ans=0;
		for(iter &e=cur[u];e!=G[u].end();++e){
			if(e->cap&&lev[e->to]+1==lev[u]){
				int delta=dfs(e->to,std::min(flow-ans,e->cap));
				if(delta){
					e->cap-=delta;
					G[e->to][e->rev].cap+=delta;
					if((ans+=delta)==flow)return flow;
				}
			}
		}
		cur[u]=G[u].begin();
		if(!--gap[lev[u]++])finished=true;
		++gap[lev[u]];
		return ans;
	}
	
	inline int mxflow(){
		int ans=0;
		BFS();finished=false;
		while(!finished)ans+=dfs(S,INF);
		return ans;
	}
}

signed main(){
//	freopen("fuck.in","r",stdin);
	n=getint(),m=getint();
	S=n<<1|1,T=S+1;
	for(int re i=1;i<=n;++i){
		NetWork::addedge(S,i,1);
		NetWork::addedge(i+n,T,1);
		NetWork::addedge(i+n,i,INF); 
	}
	while(m--)NetWork::addedge(getint(),getint()+n,INF);
	cout<<n-NetWork::mxflow();
	return 0;
}