PAT A1106 Lowest Price in Supply Chain

题目 找深度最小的叶子结点 code #include <cstdio> #include <algorithm> #include <vector> #include <cmath> using namespace std; const int maxn=100100; const int INF=1e12; vector<int>Node [maxn]; double p,r,ans=INF;

>>阅读原文<<