Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #Athenea Beltrán y Daniel Bedialauneta
- """def f(n,k,c,p): #n = longitud del vector-1 c; #c = vector; #k = cantidad de agentes-1; #p = lista con suma de costes
- if n==k:
- return max(c[0:n]),list(range(n))
- if k==1:
- for i in range(n):
- suma+=c[i]
- return suma,[]
- else:
- for i in range(k,n+1):
- c_max,div=f(i-1,k-1,c,p)"""
- def f(n,k,c,p): #n = longitud del vector-1 c; #c = vector; #k = cantidad de agentes-1; #p = lista con suma de costes
- if k==n:
- return max(c[0:n]),list(range(n))
- elif k==0: #k+1=1, donde k es cantidad de agentes -1
- return p[n],[n]
- else:
- minimo=None
- for i in range(k,n+1):
- c_max,div=f(i-1,k-1,c,p)
- nolose=max(p[n]-p[i-1],c_max)
- if minimo==None or nolose<minimo:
- minimo=nolose
- div=div+[
- return minimo,div
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement