1106 Lowest Price in Supply Chain （25 point(s)）

#include<cstdio> #include<vector> #include<iostream> #include<cmath> using namespace std; const int INF = 0x3f3f3f3f; int mindepth = INF, maxnum; int n, k; double p, r; vector<vector<int>> e; void dfs

>>阅读原文<<