比较简单:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
const int M = 9999;
const int N = 109;
const int INF = 0x3f3f3f3f;
struct LT{
int to,nex,val;
}L[M];
int F[N],cnt;
void add(int f,int t,int d)
{
L[cnt].to = t;
L[cnt].nex = F[f];
L[cnt].val = d;
F[f] = cnt++;
}
int n,m,p,dis[N],inque[N],con[N];
int que[N*N];
void solve......
阅读全文