POJ2584 T-Shirt Gumbo——网络最大流模板

题目：http://poj.org/problem?id=2584

像模板一样的简单题。继续使用 & 的当前弧优化和神奇的构造函数。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int n,head[],dfn[],cur[],l,r,mxflow,xnt,x,t;
const int INF=;
char tmp[],tm1,tm2;
struct Edge{
    int next,to,cap;
    Edge(int a=,int b=,int c=):next(a),to(b),cap(c) {}
}edge[];
queue<int> q;
int num(char c)
{
    if(c=='S')return +n;if(c=='L')return +n;
    if(c=='M')return +n;if(c=='X')return +n;if(c=='T')return +n;
}
bool bfs()
{
    memset(dfn,,sizeof dfn);
    while(!q.empty())q.pop();
    dfn[]=;
    q.push();
    while(!q.empty())
    {
        int k=q.front();q.pop();
        for(int i=head[k],v;i;i=edge[i].next)
            if(!dfn[v=edge[i].to]&&edge[i].cap)
            {
                dfn[v]=dfn[k]+;
                q.push(v);
                if(v==t)break;
            }
    }
    return dfn[t];
}
int dfs(int k,int flow)
{
    if(k==t)return flow;
    int used=;
    for(int& i=cur[k],v;i;i=edge[i].next)
        if(dfn[v=edge[i].to]==dfn[k]+&&edge[i].cap)
        {
            int tmp=dfs(v,min(flow-used,edge[i].cap));
            if(!tmp)dfn[v]=;
            used+=tmp;
            edge[i].cap-=tmp;
            edge[i^].cap+=tmp;
            if(used==flow)return used;
        }
    return used;
}
int main()
{
    while()
    {
        cin>>tmp;
        if(tmp[]=='E')return ;
        scanf("%d ",&n);
        memset(head,,sizeof head);
        t=n+;mxflow=;xnt=;
        for(int i=;i<=n;i++)
        {
            edge[++xnt]=Edge(head[],i,);head[]=xnt;
            edge[++xnt]=Edge(head[i],,);head[i]=xnt;
            scanf("%c%c ",&tm1,&tm2);
            l=num(tm1);r=num(tm2);
            for(int j=l;j<=r;j++)
            {
                edge[++xnt]=Edge(head[i],j,);head[i]=xnt;
                edge[++xnt]=Edge(head[j],i,);head[j]=xnt;
            }
        }
        for(int i=+n;i<=+n;i++)
        {
            scanf("%d",&x);
            edge[++xnt]=Edge(head[i],t,x);head[i]=xnt;
            edge[++xnt]=Edge(head[t],i,);head[t]=xnt;
        }
        cin>>tmp;
        while(bfs())
        {
            memcpy(cur,head,sizeof head);
            mxflow+=dfs(,INF);
        }
        if(mxflow==n)
            printf("T-shirts rock!\n");
        else printf("I'd rather not wear a shirt anyway...\n");
    }
}