XLJ_XLJ的博客

Time Limit:3000MS Memory Limit:30000KB 64bit IO Format:%lld & %llu Submit Status Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now exp

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who i

Time Limit:1500MS Memory Limit:131072KB 64bit IO Format:%lld & %llu Submit Status Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-tea

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu Submit Status Description Input Output Sample Input Sample Output Hint

Dijkstra：适用于权值为非负的图的单源最短路径，用斐波那契堆的复杂度O(E+VlgV) BellmanFord：适用于权值有负值的图的单源最短路径，并且能够检测负圈，复杂度O(VE) SPFA：适用于权值有负值，且没有负圈的图的单源最短路径，论文中的复杂度O(kE)，k为每个节点进入Queue的次数，且k一般<=2，但此处的复杂度证明是有问题的，其实SPFA的最坏情况应该是O(VE).