CSDN515的专栏

Agri-NetTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 28121Accepted: 11149题目链接：http://poj.org/problem?id=1258DescriptionFarmer John has bee

/*从某一个点到任意一点的最短距离,该算法可以解决负边权问题，但是不能存在环的权值为负这种情况。这算法的复杂度O(点数*边数)*/#include #include#include#define MAX 400003#define VALUE 999999using namespace std;struct edge{//定义边 int from; int t

//Dijkstra算法只能处理正边权问题#include #include#include#define MAX 100#define VALUE 0xffffffusing namespace std;int g[MAX][MAX];int d[MAX];//某一点到所有点的最短距离bool used[MAX];//已经被使用的标记int v,e;//点数和边数voi

Domino EffectTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5637Accepted: 1425题目链接：http://poj.org/problem?id=1135DescriptionDid you know tha

ArbitrageTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10954Accepted: 4608题目链接：http://poj.org/problem?id=2240DescriptionArbitrage is the us

TramTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 7135Accepted: 2583题目链接：http://poj.org/problem?id=1847DescriptionTram network in Zagrebcon

正如我们所知道的，Floyd算法用于求最短路径。Floyd算法可以说是Warshall算法的扩展，三个for循环就可以解决问题，所以它的时间复杂度为O(n^3)。Floyd算法的基本思想如下：从任意节点A到任意节点B的最短路径不外乎2种可能，1是直接从A到B，2是从A经过若干个节点X到B。所以，我们假设Dis(AB)为节点A到节点B的最短路径的距离，对于每一个节点X，我们检查Dis(AX) +

Heavy TransportationTime Limit: 3000MSMemory Limit: 30000KTotal Submissions: 15487Accepted: 4026题目链接http://poj.org/problem?id=1797

Til the Cows Come HomeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 20550Accepted: 6864题目链接：http://poj.org/problem?id=2387DescriptionBessie

Heavy CargoTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2264Accepted: 1252题目链接：http://poj.org/problem?id=2263DescriptionBig Johnsson Truck

Minimal Ratio TreeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 836Accepted: 304题目链接：http://poj.org/problem?id=3925DescriptionFor a tree, w

SPFA算法是对bellman-fort算法的进一步优化，更大程度的减小时间复杂度；具体看代码#include#include#include#define info 99999#define maxn 100using namespace std;int dis[maxn];int v,e;//点，边queue q;int flag[maxn];//表示