传送门:
I Am Here
常规解法是贪心,但是在复习最大流的写法,因此用sap来写的。思路是很好想的
#include<cstdio> #include<cstdlib> #include<iostream> #include<cstring> #include<algorithm> #include<memory.h> #include<cmath> using namespace std; const int M=2510000; int s,t,cnt; int a[4000],b[4000],num[1010];; const int inf=1000000; int vd[4001],dis[4001],ans,m,n; int Laxt[M],Next[M],Val[M],To[M]; void _update() { memset(vd,0,sizeof(vd)); memset(dis,0,sizeof(dis)); memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); memset(To,0,sizeof(To)); memset(num,0,sizeof(num)); memset(Laxt,0