Answered step by step
Verified Expert Solution
Link Copied!
Question
1 Approved Answer

import sys numServ = 0 plCost = [] costArr = [[]] def lCost(index): costArr = [[sys.maxint for i in range(index)] for j in range(index)] costArr[index-1][0]

import sys

numServ = 0

plCost = []

costArr = [[]]

def lCost(index):

costArr = [[sys.maxint for i in range(index)] for j in range(index)]

costArr[index-1][0] = plCost[index-1]

for i in range(index-2, -1, -1):

for dist in range(index-1, -1, -1):

if dist == 0:

costArr[i][0] = min(costArr[i+1]) + plCost[i]

else:

costArr[i][dist] = costArr[i+1][dist-1] + dist

return min(costArr[0])

if __name__ == "__main__":

numServ = int(raw_input())

for index in range(0, numServ):

plCost.insert(index, int(raw_input()))

print lCost(numServ)

can someone help convert this ti C++ code so i can understand it better

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image
Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Intelligent Information And Database Systems Asian Conference Aciids 2012 Kaohsiung Taiwan March 2012 Proceedings Part 2 Lnai 7197

Authors: Jeng-Shyang Pan ,Shyi-Ming Chen ,Ngoc-Thanh Nguyen

2012th Edition

3642284892, 978-3642284892

More Books

Students explore these related Databases questions

Question

Define decision trees.

Answered: 3 weeks ago