practica 2 piccolo

def suma_costes(c):
    P=[c[0]]
    for i in range(1,len(c)):
        P.append(P[-1]+c[i])
    return P

# n: índice de la última tarea considerada
# k: índice del último agente considerado (k se indexa desde 0)
def fuerza_bruta(n,k,c,P):
    if n==k:
        return max(c[0:n+1]),[i for i in range(n+1)]
    elif k==0:
        return P[n],[n]
    else:
        minimo=None
        for i in range(k,n+1):
            c_fb, p_fb = fuerza_bruta(i-1,k-1,c,P)
            if c_fb < P[n]-P[i-1]:
                c_fb = P[n]-P[i-1]
            if minimo==None or c_fb < minimo:
                minimo=c_fb
                arg_min = p_fb + [n]
        return minimo, arg_min


def fuerza_dinamica(n,k,c,P):
    F=[[P[i]] for i in range(n)]
    F[1].append(max(c[:2]))
    G=[[0] for i in range(n)]
    G[1].append(1)
    for fila in range(2,n):
        for columna in range(1,min(n,k)):


c=[8,6,7,2,1,4]
P=suma_costes(c)
print(fuerza_bruta(len(c)-1,2,c,P))