摘要:
和poj 1860差不多都用bellman—ford最简单的版本就可以了,关键在于巧妙的运用,做过了才能更好地理解》#include<stdio.h>#include<queue>#include<string.h>#define INF 100000000#define MAXN1 520#define MAXN 8000int u[MAXN],v[MAXN],wt[MAXN], d[MAXN1];int n, m, w, T,p;void init(){ scanf("%d%d%d",&n,&m,&w); p 阅读全文