Bienvenido a Internet ■Volver al BBS■ Hilo completo ▼Bajar▼

Wonder Woman (20 respuestas)

12 : Nameless@Passing through the lobby [SG] (*.singnet.com.sg) : 25/03/23(sat)05:59:06 ID:RkMjllY20 rep del

int minProduct (int a, int b)

{

int bigger = a < b ? b : a;

int smaller = a < b ? a : b;

int memo[] = new int [smaller + 1];

return minProduct (smaller, bigger, memo);

}

int minProduct (int smaller, int bigger, int[] memo)

{

if (smaller == 0)

{

return 0;

}

else if (smaller == 1)

{

return bigger;

}

else if (memo[smaller] > 0)

{

return memo[smaller];

}

/* Compute half. If uneven, compute other half. If even, double it. */

int s = smaller >> 1; //Divide by 2

int side1 = minProduct (s, bigger, memo); //Compute half

int side2 = side1;

if (smaller % 2 == 1)

{

side2 = minProduct (smaller - s, bigger, memo);

}

/* Sum and cache. */

memo[smaller] = side1 + side2;

return memo[smaller];

}
6 KB

Ver nuevos posts

No tocar:
Nombre:  E-mail: 
weabot.py ver 0.11.0 neptune ★