算法竞赛入门经典(第二版)----图论模型与算法
文章平均质量分 77
wang2147483647
这个作者很懒,什么都没留下…
展开
-
UVA 1001(p379)----Say Cheese
#include#include#include#includeusing namespace std;const int maxn=200;const double inf=9999999999.0;double g[maxn][maxn],ans;int n,x[maxn],y[maxn],z[maxn],ans1;int x1,x2,yy1,y2,z1,z2,r[maxn]原创 2016-02-25 23:28:55 · 476 阅读 · 0 评论 -
UVA 820(p380)----Internet Bandwidth
#include#include#include#include#includeusing namespace std;const int inf=100000000;const int maxn=500,maxm=500000;struct edge{ int v,f,nxt;};int n,src,sink,m;int g[maxn+50];int num;原创 2016-02-25 23:25:01 · 549 阅读 · 0 评论 -
UVA 247(p365)----Calling Circles
#include#include#include#includeusing namespace std;vector name,ans;string st1,st2;bool g[100][100],v[100];int n,m;void floyd(){ for(int k=0; k<=n; k++) for(int i=0; i<=n; i++)原创 2016-02-25 22:43:43 · 507 阅读 · 0 评论 -
UVA 12549(p381)----Sentry Robots
#include#include#include#include#includeusing namespace std;const int maxn=1100;struct point{ int x,y;};point mm[maxn][maxn];int from[maxn],use[maxn];int Map[maxn][maxn];int n,m,t,num原创 2016-02-27 14:06:15 · 686 阅读 · 0 评论 -
UVA 10801(p381)----Lift Hopping
#include#include#include#include#includeusing namespace std;int v[200],dist[200],n,k,lift[200];int now,g[200][200],t[200];queue q;void solve(){ memset(v,0,sizeof(v)); memset(dist,127原创 2016-02-27 13:22:02 · 214 阅读 · 0 评论 -
UVA 1664(p382)----Conquer a New Region
#include#include#include#includeusing namespace std;typedef long long LL;const int maxn=200000+50;struct point{ LL u,v,w;};point g[maxn];LL sum[maxn],n;LL fa[maxn],num[maxn];LL Find(L原创 2016-02-26 14:07:56 · 398 阅读 · 0 评论 -
UVA 1663(p381)----Purifying Machine
# include# include# include# include# includeusing namespace std;const int maxn=3000+50;vectorb;int vis[maxn];int n,m,a[maxn][maxn],t[maxn];int A[11]= {1,2,4,8,16,32,64,128,256,512,1024};vo原创 2016-02-26 14:06:45 · 551 阅读 · 0 评论 -
UVA 1660(p380)----Cable TV Network
#include#include#include#include#include#includeusing namespace std;const int maxn = 50*50+10;const int INF = 1000000000;int n,m;vector flag;struct Edge{ int from, to, cap, flow; E原创 2016-02-26 14:02:43 · 533 阅读 · 0 评论 -
UVA 821(p379)----Page Hopping
#include#include#includeusing namespace std;const int maxx=2147483647/3;int g[155][155],ans,num;void init(){ for(int i=0;i<=100;i++) for(int j=0;j<=100;j++) g[i][j]=maxx;原创 2016-02-25 23:26:25 · 284 阅读 · 0 评论