摘要: 题目链接:http://poj.org/problem?id=2449#include#include#include#include#includeusing namespace std;const int maxn = 1005;const int maxe = 100050;const int INF = 0x3f3f3f3f;struct Edge{ int v,w; int next; Edge(int v=0,int w=0,int next=0): v(v), w(w), next(next){}};struct Heap{ int u,f... 阅读全文
posted @ 2013-09-03 11:44 等待最好的两个人 阅读(140) 评论(0) 推荐(0) 编辑