2014-2015 ACM-ICPC, Asia Xian Regional Contest Problem C. The Problem Needs 3D Arrays(网络流之最大密度子图)
题意:给你一个长度为n(#definelllonglong#defineinf0x3f3f3f3f#definerep(i,a,b)for(registerinti=(a);i=(b);i--)usingnamespacestd;#definemaxn200010#defineclear(A,X)memset(A,X,sizeofA)#definecopy(A,B)memcpy(A,B,sizeo