![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论 - 网络流
Napoleon2004
这个作者很懒,什么都没留下…
展开
-
HDU 3549 Flow Problem
#include<queue> #include<cstdio> #include<cstring> using namespace std; const int inf=0x3f3f3f3f,MAX=205; int n,m,c[MAX][MAX],dep[MAX]; int bfs(int s, int t){ queue<int>q; ...原创 2018-04-01 19:48:18 · 95 阅读 · 0 评论 -
UVA 11082 Matrix Decompressing
#include<bits/stdc++.h> using namespace std; int r,c,a[30],b[30],pre[50],h[50][50]; bool vis[50]; int bfs(int s,int t){ int i,p; memset(vis,0,sizeof(vis)); queue<int>q;q.push(s); pre[s...原创 2018-05-18 09:32:43 · 134 阅读 · 0 评论 -
POJ 1273 Drainage Ditches
#include<bits/stdc++.h> using namespace std; const int M=210; bool visit[M]; int m,n,pre[M],r[M][M]; int bfs(int s,int t){ int i,p; queue<int>q; pre[s]=s; visit[s]=1; q.push(s); mems...原创 2018-05-06 11:59:16 · 109 阅读 · 0 评论 -
UVA 743 A Plug for UNIX
#include<bits/stdc++.h> using namespace std; const int M=510,Inf=0x3f3f3f3f; map<string,int>mp; bool visit[M]; int l,pre[M],r[M][M]; string q[M],p[M]; int bfs(int s,int t){ int i,p; mems...原创 2018-05-06 12:01:09 · 121 阅读 · 0 评论 -
ZOJ 2760 How Many Shortest Path
#include<queue> #include<cstdio> #include<vector> #include<cstring> using namespace std; const int M=110,inf=0x3f3f3f3f; struct node{ int x,y,l; }; vector<node>g; int n,...原创 2018-06-05 20:56:31 · 157 阅读 · 0 评论