网络流二十四题之航空路线问题

这道题的建模很有意思：
1.首先每个点，除了起点，都向拆点后的点练一天容量1，费用-1的边，代表只能走一次，负费用是为了求最大的费用，也就是最多的经过点。对于起点，容量变成2，费用不变。
2.其次对于一天航线，终点在拆点后的点集向起点连一条边，容量无限，费用为0，代表两个城市可以达到。
之后一次费用流，如果可以到达，说明最大流肯定是2，将起点的次数排除，答案就是2 - 最小费用（因为费用是负的）

#include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
const int MAXN = 10000;
const int MAXM = 100000;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int to,next,cap,flow,cost,from;
} edge[MAXM];
int head[MAXN],tol;
int pre[MAXN],dis[MAXN];
bool vis[MAXN];
int N;//节点总个数，节点编号从0~N-1
void init(int n)
{
    N = n;
    tol = 0;
    memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int cap,int cost)
{
    edge[tol].to = v;
    edge[tol].from = u;
    edge[tol].cap = cap;
    edge[tol].cost = cost;
    edge[tol].flow = 0;
    edge[tol].next = head[u];
    head[u] = tol++;
    edge[tol].to = u;
    edge[tol].from = v;
    edge[tol].cap = 0;
    edge[tol].cost = -cost;
    edge[tol].flow = 0;
    edge[tol].next = head[v];
    head[v] = tol++;
}
bool spfa(int s,int t)
{
    queue<int>q;
    for(int i = 0; i < N; i++)
    {
        dis[i] = INF;
        vis[i] = false;
        pre[i] = -1;
    }
    dis[s] = 0;
    vis[s] = true;
    q.push(s);
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = false;
        for(int i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].to;
            if(edge[i].cap > edge[i].flow &&
                    dis[v] > dis[u] + edge[i].cost )
            {
                dis[v] = dis[u] + edge[i].cost;
                pre[v] = i;
                if(!vis[v])
                {
                    vis[v] = true;
                    q.push(v);
                }
            }
        }
    }
    if(pre[t] == -1)
        return false;
    else
        return true;
}
//返回的是最大流，cost存的是最小费用
int minCostMaxflow(int s,int t,int &cost)
{
    int flow = 0;
    cost = 0;
    while(spfa(s,t))
    {
        int Min = INF;
        for(int i = pre[t]; i != -1; i = pre[edge[i^1].to])
        {
            if(Min > edge[i].cap - edge[i].flow)
                Min = edge[i].cap - edge[i].flow;
        }
        for(int i = pre[t]; i != -1; i = pre[edge[i^1].to])
        {
            edge[i].flow += Min;
            edge[i^1].flow -= Min;
            cost += edge[i].cost * Min;
        }
        flow += Min;
    }
    return flow;
}
void print_all()
{
    for(int i = 0;i<tol;i+=2)
    {
        printf("%d -> %d cap = %d flow = %d cost = %d\n",edge[i].from,edge[i].to,edge[i].cap,edge[i].flow,edge[i].cost);
    }
}
map<string,int> haash;
map<int,string> rehash;
int st[MAXN];
int main()
{
    int n,m;
    cin>>n>>m;
    init(2*n+2);
    addedge(1,1+n,2,0);
    for(int i = 2;i<n;i++)
    {
        addedge(i,i+n,1,-1);
    }
    for(int i =1;i<=n;i++)
    {
        string s;
        cin>>s;
        haash[s] = i;
        rehash[i] = s;
    }
    for(int i = 0;i<m;i++)
    {
        int u,v;
        string s1,s2;
        cin>>s1>>s2;
        u = haash[s1];
        v = haash[s2];
        addedge(u+n,v,INF,0);
    }
    int cost = 0;
    int ans = minCostMaxflow(1,n,cost);
    cost = 2 - cost;
    if(ans != 2) return 0 * printf("No Solution!");
    printf("%d\n",cost);
    //print_all();
    return 0;
}