Dijkstra,最短路树(战争和物流,LA 4080)
学会了最短路树。
#include
#include
using namespace std;
typedef long long ll;
const ll maxn = 110;
const ll maxm = 1010;
const ll inf = LONG_LONG_MAX>>2;
struct Edge
{
ll from,to,dist;
};
struct He
原创
2017-02-10 12:48:29 ·
839 阅读 ·
0 评论