[BZOJ]2127happiness 最大权闭合图再谈(二)
[i][j]-x2[i][j]; map1.putx(map1.s,(i-1)*m+j,x1[i][j]-x2[i][j]); } else map1.putx((i-1)*m+j,map1.t,x2[i][j]-x1[i][j]); } int tot=n*m; for (int i=1;i<=n-1;i++) for (int j=1;j<=m;j++) { x3[i][j]=get_int(); tot++; map1.putx(map1.s,tot,x3[i][j]); zh+=x3[i][j]; map1.putx(tot,(i-1)*m+j,inf); map1.putx(tot,i*m+j,inf); } for (int i=1;i<=n-1;i++) for (int j=1;j<=m;j++) { ans+=x4[i][j]=get_int(); tot++; map1.putx(tot,map1.t,x4[i][j]); map1.putx((i-1)*m+j,tot,inf); map1.putx(i*m+j,tot,inf); } for (int i=1;i<=n;i++) for (int j=1;j<=m-1;j++) { x5[i][j]=get_int(); tot++; zh+=x5[i][j]; map1.putx(map1.s,tot,x5[i][j]); map1.putx(tot,(i-1)*m+j,inf); map1.putx(tot,(i-1)*m+j+1,inf); } for (int i=1;i<=n;i++) for (int j=1;j<=m-1;j++) { ans+=x6[i][j]=get_int(); tot++; map1.putx(tot,map1.t,x6[i][j]); map1.putx((i-1)*m+j,tot,inf); map1.putx((i-1)*m+j+1,tot,inf); } ans+=zh-map1.sap(tot+2); printf("%d\n",ans); }