ACM

Bellman-Ford算法简介

  Bellman-Ford算法用于计算有向图中的单源最短路径。对于有V个顶点和E条边的图,Bellman-Ford的时间复杂度为O(V·E),效率低于Dijkstra算法。Bellman-Ford可以用于有负权边的情况,且能判断负权环,十分灵活。   Wiki上给出的Bellman-Ford算法的伪代码如下所示: function BellmanFord(list vertices, list …
Read more

POJ 3414. Pots

1. 题目 http://poj.org/problem?id=3414 Pots Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12107 Accepted: 5110 Special Judge Description You are given two pots, having the volume of A and B…
Read more

URAL 1263. Elections

1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1643 1263. Elections Time limit: 1.0 second Memory limit: 64 MB The next in turn elections are to come soon. All the fences are postered with lea…
Read more