A1106-Lowest Price in Supply Chain

和A1090一模一样,没什么可说的

#include
using namespace std;
int N;
double p,r;
vector child[100010];
double sum=0;
int minDepth=100010,minNum=0;
void DFS(int index,int depth)
{
    if(child[index].size()==0)
    {
        if(depth

你可能感兴趣的:(A1106-Lowest Price in Supply Chain)