BZOJ3996 线性代数(最小割)

目标：

$$ans = min \sum_{i = 1}^{N} A_{1,i} (\sum_{j = 1}^{N}A_{1,j}*B_{j,i} - C_{1,i})$$
化简得到
$$ans = min \sum_{i = 1}^{N}\sum_{j = 1}^{N}A_{1,i}*A_{1,j}*B_{i,j} - \sum_{i = 1}^{N}A_{1,i}*C_{1,i}$$
而 $A_i = 0,1$,因此转化为这个模型：
又n个物品，如果物品i,j都选取，获得 $B_{i,j}$的利润，而选取物品i,j分别花费 $C_i,C_j$的代价。这是一个最小割的模型。
源点向 $(i,j)$连边，容量为 $B_{i,j}$， $(i,j)$向i,j连边，容量为INF，i,j向汇点连边，容量为 $C_i,C_j$，求出来的最小割也就是花费的最小代价，用总利润减去最小代价也就是最大获利。

#include<cstdio>
#include<cstring>
#include<vector>
#include<iostream>
#define INF 0x7fffffffLL
#define MAXN 300010
using namespace std;
typedef long long LL;
inline LL Min(LL a,LL b)
{return a<b?a:b;}
struct E
{
    int v,op;
    LL w;
    E(){}
    E(int a,LL b,int c)
    {v = a; w = b; op = c;}
};
vector<E> g[MAXN];
void add(int u,int v,LL w)
{
    g[u].push_back(E(v,w,g[v].size()));
    g[v].push_back(E(u,0,g[u].size()-1));
}
int d[MAXN],vd[MAXN],n,b[510][510],c[510],s,t,N;
LL sum,flow;
LL aug(int i,LL augco)
{
    int j,mind = N-1,sz = g[i].size();
    LL augc = augco,delta;
    if(i == t) return augco;

    for(j = 0; j < sz; j++)
    {
        int v = g[i][j].v;
        if(g[i][j].w)
        {
            if(d[i] == d[v]+1)
            {
                delta = Min(augc,g[i][j].w);
                delta = aug(v,delta);
                g[i][j].w -= delta;
                g[v][g[i][j].op].w += delta;
                augc -= delta;
                if(d[s] >= N) return augco-augc;
                if(augc == 0) break;
            }
            if(d[v] < mind) mind = d[v];
        }
    }
    if(augco == augc)
    {
        vd[d[i]]--;
        if(!vd[d[i]]) d[s] = N;
        d[i] = mind+1;
        vd[d[i]]++;
    }
    return augco-augc;
}
void sap()
{
    flow = 0;
    memset(d,0,sizeof d);
    memset(vd,0,sizeof vd);
    vd[0] = N;
    while(d[s] < N)
        flow += aug(s,INF);
}
int main()
{
    scanf("%d",&n);
    N = n*n;
    s = 0,t = 300001;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
        {   
            scanf("%d",&b[i][j]);
            sum += b[i][j];
            add(s,(i-1)*n+j,1LL*b[i][j]);
            add((i-1)*n+j,N+i,INF);
            add((i-1)*n+j,N+j,INF);
        }   
    for(int i = 1; i <= n; i++)
    {   
        scanf("%d",&c[i]);
        add(N+i,t,1LL*c[i]);
    }
    N = n+n*n+2;
    sap();
    cout<<sum-flow<<endl;
}