GDUFE_SSS

传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1532 题意&思路：给出m条河流n个点及河流流量，求最大流 AC代码： #include #include #include #include #define INF 1e9 using namespace std; const int MAX_V=500; struc

Dijkstra算法： 解决的问题：     带权重的有向图上单源最短路径问题。且权重都为非负值。如果采用的实现方法合适，Dijkstra运行时间要低于Bellman-Ford算法。 思路：     如果存在一条从i到j的最短路径(Vi.....Vk,Vj)，Vk是Vj前面的一顶点。那么(Vi...Vk)也必定是从i到k的最短路径。为了求出最短路径，Dijkstra就提出了

Arbitrage Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 24944   Accepted: 10568 Description Arbitrage is the use of discrepancies in currency exchange rate

Cow Contest Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 13409   Accepted: 7465 Description N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are part

MPI Maelstrom Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 10524   Accepted: 6466 Description BIT has recently taken delivery of their new supercomputer,

Going Home Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 23975   Accepted: 12034 Description On a grid map there are n little men and n houses. In each uni

Minimum Cost Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 17611   Accepted: 6191 Description Dearboy, a goods victualer, now comes to a big problem, and h

Candies Time Limit: 1500MS   Memory Limit: 131072K Total Submissions: 33931   Accepted: 9528 Description During the kindergarten days, flymouse was the monitor of his c

Invitation Cards Time Limit: 8000MS   Memory Limit: 262144K Total Submissions: 29736   Accepted: 9918 Description In the age of television, not many people attend theater

const int MAX_V=1e8; struct edge{ int to,cap,rev; }; vector G[MAX_V]; //图的邻接表表示 int level[MAX_V]; //顶点到原点的距离标号 int iter[MAX_V]; //当前弧，在其之前的边已经没有用了 //增加一条从from到to的容量为cap的边 void add

题意： 给出多个farms，及farm之间的路径长度（双向），利用虫洞进行时光旅行（即路径为负），问是否存在负环。 Bell_Ford算法： bool Bell_Ford(int s){ //s为起始地点 memset(dis,INF,sizeof(dis)); bool flag; dis[s]=0; for(int j=1;j<=nodeNum

昂贵的聘礼 Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 51944   Accepted: 15612 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。