public int[] bestSolution(String data) {
String[] dataAux = data.split("\\p{Space}+");
N = new Integer(dataAux[0]);
D = new Integer(dataAux[3]);
n = new int[N];
for (int i = 0; i < N; i++) {
n[i] = new Integer(dataAux[i + 4]);
}
T1 = new Integer(dataAux[1]);
T2 = new Integer(dataAux[2]);
Nodo.N = N;
Nodo.D = D;
Nodo.n = n;
Nodo.T1 = T1;
Nodo.T2 = T2;
Nodo.resultadoExacto = P202Aux.best(data);
Nodo nodo = Nodo.RyP(null);
int[] solucion = new int[N + 1];
solucion[0] = nodo.t1 + nodo.t2;
for (int i = 0; i < N; i++) {
solucion[i + 1] = nodo.estado[i];
}
return solucion;
}
