hdu 2883 最大流

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<memory.h>
using namespace std;
const int M=202;
const int MAXN=500000;
const int INF=0x3f3ff3f;
int t,n,m,tot;
int gap[MAXN],dis[MAXN],pre[MAXN],head[MAXN],cur[MAXN];
int NE,NV,sink,s[M],e[M],tol[M*2];
struct Node
{
    int c,pos,next;
} E[MAXN];
#define FF(i,NV) for(int i=0;i<NV;i++)
int sap(int s,int t)
{
    memset(dis,0,sizeof(int)*(NV+1));
    memset(gap,0,sizeof(int)*(NV+1));
    FF(i,NV) cur[i] = head[i];
    int u = pre[s] = s,maxflow = 0,aug =INF;
    gap[0] = NV;
    while(dis[s] < NV)
    {
loop:
        for(int &i = cur[u]; i != -1; i = E[i].next)
        {
            int v = E[i].pos;
            if(E[i].c && dis[u] == dis[v] + 1)
            {
                aug=min(aug,E[i].c);
                pre[v] = u;
                u = v;
                if(v == t)
                {
                    maxflow += aug;
                    for(u = pre[u]; v != s; v = u,u = pre[u])
                    {
                        E[cur[u]].c -= aug;
                        E[cur[u]^1].c += aug;
                    }
                    aug =INF;
                }
                goto loop;
            }
        }
        int mindis = NV;
        for(int i = head[u]; i != -1 ; i = E[i].next)
        {
            int v = E[i].pos;
            if(E[i].c && mindis > dis[v])
            {
                cur[u] = i;
                mindis = dis[v];
            }
        }

        if( (--gap[dis[u]]) == 0)	break;
        gap[ dis[u] = mindis+1 ] ++;
        u = pre[u];
    }
    return maxflow;
}
void addEdge(int u,int v,int c )
{
    E[NE].c = c;
    E[NE].pos = v;
    E[NE].next = head[u];
    head[u] = NE++;
    E[NE].c = 0;
    E[NE].pos = u;
    E[NE].next = head[v];
    head[v] = NE++;
}
int main()
{
    int t, n, m, ti, ni;
    int  sum, source, sink, vn;
    while(scanf("%d %d", &n, &m)!=EOF)
    {
        NE=0,tot=0;  sum = 0;source = 0;
        memset(head, -1, sizeof(head));
        for (int i = 1; i <= n; ++i)
        {
            scanf("%d %d %d %d", &s[i], &ni,&e[i],&ti);
            sum += ni*ti;
            addEdge(source, i, ti*ni);
            tol[tot++]=s[i];
            tol[tot++]=e[i];
        }
        sort(tol,tol+tot);
        int c=0;
        for(int i=1;i<tot;i++)
        {
            if(tol[c]!=tol[i]) tol[++c]=tol[i];
        }
       // tot=*unique(tol,tol+tot);
        sink=c+n+1;
        NV=sink+1;
        for(int i=1;i<=c;i++)
        {
            int tmp=tol[i]-tol[i-1];
            addEdge(n+i,sink,tmp*m);
            for(int j=1;j<=n;j++)
            {
                if(tol[i-1]>=s[j]&&tol[i]<=e[j])
                {
                    addEdge(j,i+n,INF);
                }
            }
        }
        if(sap(source,sink)==sum)
        cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}

解题思路;(借鉴网上某大牛的思路）

                      将所有的到达时间和结束时间按升序排序，得到 x <= 2n-1 个时间区间。建立网络流模型：s为源，t为汇，每个顾客i作为一个结点并连边（s, i, ni*ti），每个区间j作为一个结点并连边(j, t, (ej-sj)*M)，其中sj, ej分别表示区间j的起始时间和终止时间。对任意顾客i和区间j，若 [sj, ej] 完全包含在 [si, ei] 之中，则连边(i, j, INF)。若最大流等于 ∑ni*ti 则是 Yes，否则是 No。