topcoder powerOutage

#include<iostream>
#include<vector>
using namespace std;
int maxDuctLength(vector<int>fromJunction,vector<int>toJunction,vector<int>ductLength,int ductNumber)
{
int result=0;
for(size_t i=0;i<fromJunction.size();++i)
{
if(ductNumber==fromJunction[i])
result=max(result,ductLength[i]+maxDuctLength(fromJunction,toJunction,ductLength,toJunction[i]));
}
return result;
}
int estimateTimeOut(vector<int>fromJunction,vector<int>toJunction,vector<int>ductLength)
{
int result=-maxDuctLength(fromJunction,toJunction,ductLength,0);
for(size_t i=0;i<ductLength.size();++i)
{
result+=2*ductLength[i];
}
return result;
}


int main()
{
int a[]={0,0,0,1,4,4,6,7,7,7,20};
vector<int> fromJunction(a,a+sizeof(a)/sizeof(int));
int b[]={1,3,4,2,5,6,7,20,9,10,31};
vector<int> toJunction(b,b+sizeof(b)/sizeof(int));
int c[]={10,10,100,10,5,1,1,100,1,1,5};
vector<int> ductLength(c,c+sizeof(c)/sizeof(int));
cout<<estimateTimeOut(fromJunction,toJunction,ductLength)<<endl;
return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值