Floyd 及其扩展算法（最小代价回路）
关注
分享
扫一扫
bobten2008
这个作者很懒，什么都没留下…
展开
-
POJ 1734 Sightseeing trip
/*第一次用扩展的Floyd来寻找最小代价环*/#include #define MAX_N 105#define MAX_VAL 666666666using namespace std;int N, M, minLen;int weight[MAX_N + 1][MAX_N + 1];int graph[MAX_N + 1][MAX_N + 1];int p原创 2009-11-20 14:25:00 · 1442 阅读 · 2 评论 -
POJ 2112 Optimal Milking
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 3151 Accepted: 1260Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K原创 2010-01-11 23:51:00 · 1205 阅读 · 0 评论