1090 Highest Price in Supply Chain （25 point(s)）

题解 dfs. #include<iostream> #include<cstdio> #include<algorithm> #include<vector> #include<cmath> using namespace std; int maxdepth, maxnum; vector<vector<int>> e; int n, x; double p, r; void dfs(int d

>>阅读原文<<