https://blog.youkuaiyun.com/QFWEMPIPzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/QFWEMPIP/article/details/123705777https://blog.youkuaiyun.com/QFWEMPIP/article/details/123705777QFWEMPIPThu, 24 Mar 2022 11:02:44 +0800https://blog.youkuaiyun.com/QFWEMPIP/article/details/46552909https://blog.youkuaiyun.com/QFWEMPIP/article/details/46552909QFWEMPIPThu, 18 Jun 2015 21:47:10 +0800https://blog.youkuaiyun.com/QFWEMPIP/article/details/46536855https://blog.youkuaiyun.com/QFWEMPIP/article/details/46536855QFWEMPIPWed, 17 Jun 2015 18:35:52 +0800>2; struct edge{int t,f;edge*nxt,*pair;}*g[N],*d[N]; int n,m,S,T,h[N],gap[N],maxflow; inline int min(int x,int y){return xhttps://blog.youkuaiyun.com/QFWEMPIP/article/details/46536835https://blog.youkuaiyun.com/QFWEMPIP/article/details/46536835QFWEMPIPWed, 17 Jun 2015 18:33:13 +0800 rhs.d; } }; vector edge; vector p[MAXN]; bool]]>https://blog.youkuaiyun.com/QFWEMPIP/article/details/46274057https://blog.youkuaiyun.com/QFWEMPIP/article/details/46274057QFWEMPIPSat, 30 May 2015 13:57:01 +0800>1; int headlist[MAXN],d[MAXN]; bool vis[MAXN]; queue q; int T,C,Rs,Re,Ts,Te,Ci; struct Q{int w,nex,to;}edge[MAXN]; void read(int ]]>https://blog.youkuaiyun.com/QFWEMPIP/article/details/45287085https://blog.youkuaiyun.com/QFWEMPIP/article/details/45287085QFWEMPIPSun, 26 Apr 2015 11:42:29 +0800r; p->r=q->l; q->l=p; p=q;} void Splay R(Sp]]>https://blog.youkuaiyun.com/QFWEMPIP/article/details/44995021https://blog.youkuaiyun.com/QFWEMPIP/article/details/44995021QFWEMPIPSat, 11 Apr 2015 14:09:14 +0800https://blog.youkuaiyun.com/QFWEMPIP/article/details/44674507https://blog.youkuaiyun.com/QFWEMPIP/article/details/44674507QFWEMPIPFri, 27 Mar 2015 13:00:06 +0800https://blog.youkuaiyun.com/QFWEMPIP/article/details/44132001https://blog.youkuaiyun.com/QFWEMPIP/article/details/44132001QFWEMPIPSun, 08 Mar 2015 11:59:43 +0800