PAT A1079 Total Sales of Supply Chain (25 point(s))

題目 Code #include #include #include #include using namespace std; const int maxn=100100; struct node{ double data; vector child; }Node[maxn]; int n; double p,r,ans=0; void DFS(int index,int depth){ if(

>>阅读原文<<