摘要： 大意：给定一张无向图，让以最少的次数将起点的全部乘客运往终点，图中的每个节点有容量限制。思路：与UVA 10048 差不多，都可以用Floyd动态规划去解决。d[i][j] = max(d[i][j], min(d[i][k], d[k][j]));另外：导游也算一个容量。CODE:#include<iostream>#include<cstdlib>#include<cstdio>#include<cstring>usingnamespacestd;#defineMAXN110intd[MAXN][MAXN];intn,m;voidinit() 阅读全文

摘要： 最优比率生成树。CODE：#include<cstdio>#include<cstring>#include<cstdlib>#include<iostream>#include<cmath>usingnamespacestd;#defineeps1e-4constintINF=0x3f3f3f3f;constintMAXN=1010;doublew[MAXN][MAXN],d[MAXN];doubledis[MAXN][MAXN],cost[MAXN][MAXN];intn,m;structnode{doublex,y,z;}a[M 阅读全文

摘要： SPFA+0/1分数规划。CODE:#include<iostream>#include<cstdlib>#include<cstdio>#include<cstring>#include<queue>usingnamespacestd;#defineMAXN1010#defineINF0X3F3F3F3F#defineeps1e-7structEdge{intv,next;doublew;}edge[MAXN*5];doubled[MAXN],num[MAXN];intfirst[MAXN];intn,m,cnt;voidinit( 阅读全文