频道栏目
首页 > 程序开发 > 软件开发 > C++ > 正文
HDU1532_Drainage Ditches(网络流/EK模板)
2014-07-16 10:42:29         来源:_nplus  
收藏   我要投稿

Drainage Ditches

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8599 Accepted Submission(s): 4005


Problem Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built a set of drainage ditches so that Bessie's clover patch is never covered in water. Instead, the water is drained to a nearby stream. Being an ace engineer, Farmer John has also installed regulators at the beginning of each ditch, so he can control at what rate water flows into that ditch.
Farmer John knows not only how many gallons of water each ditch can transport per minute but also the exact layout of the ditches, which feed out of the pond and into each other and stream in a potentially complex network.
Given all this information, determine the maximum rate at which water can be transported out of the pond and into the stream. For any given ditch, water flows in only one direction, but there might be a way that water can flow in a circle.

Input The input includes several cases. For each case, the first line contains two space-separated integers, N (0 <= N <= 200) and M (2 <= M <= 200). N is the number of ditches that Farmer John has dug. M is the number of intersections points for those ditches. Intersection 1 is the pond. Intersection point M is the stream. Each of the following N lines contains three integers, Si, Ei, and Ci. Si and Ei (1 <= Si, Ei <= M) designate the intersections between which this ditch flows. Water will flow through this ditch from Si to Ei. Ci (0 <= Ci <= 10,000,000) is the maximum rate at which water will flow through the ditch.

Output For each case, output a single integer, the maximum rate at which water may emptied from the pond.

Sample Input
5 4
1 2 40
1 4 20
2 4 20
2 3 30
3 4 10

Sample Output
50

Source USACO 93 解题报告 EK模板,不多说。
#include 
#include 
#include 
#include 
#define inf 99999999
#define N 220
#define M 220
using namespace std;
int n,m,edge[N][N],flow,a[N],p[N];
queueQ;
void ek()
{
    while(1)
    {
        while(!Q.empty())
        Q.pop();
        memset(a,0,sizeof(a));
        memset(p,0,sizeof(p));
        Q.push(1);
        a[1]=inf;
        p[1]=1;
        while(!Q.empty())
        {
            int u=Q.front();
            Q.pop();
            for(int v=1;v<=n;v++)
            {
                if(!a[v]&&edge[u][v]>0)
                {
                    a[v]=min(a[u],edge[u][v]);
                    p[v]=u;
                    Q.push(v);
                }
            }
            if(a[n])break;
        }
        if(!a[n])break;
        for(int u=n;u!=1;u=p[u])
        {
            edge[p[u]][u]-=a[n];
            edge[u][p[u]]+=a[n];
        }
        flow+=a[n];
    }
}
int main()
{
    int i,j,u,v,w;
    while(~scanf("%d%d",&m,&n))
    {
        flow=0;
        memset(edge,0,sizeof(edge));
        for(i=0;i


点击复制链接 与好友分享!回本站首页
相关TAG标签 模板 网络
上一篇:UVA Stamps
下一篇:编程算法 - 求1+2+...+n(构造函数) 代码(C++)
相关文章
图文推荐
点击排行

关于我们 | 联系我们 | 广告服务 | 投资合作 | 版权申明 | 在线帮助 | 网站地图 | 作品发布 | Vip技术培训 | 举报中心

版权所有: 红黑联盟--致力于做实用的IT技术学习网站