|
|
back to board♠♠♠♦♦•◘How to slove this problem? Posted by temp5 29 Jun 2007 17:30 please help. Thanks Re: Simply DP... Thanks. But I dont understand what is the DP. May be you mean Brut Forse Re: Simply DP... DP means dinamic program. Re: Simply DP... Thanks and best wishes! ==) ☺ Re: Simply DP... Greedy algo. merge amt-1 with amt-2. merge leftover of amt-2 with amt-3, merge leftover of amt-3 with amt-4 (amt-N stands for number-of-types-of-diplomas-with-amount-N). Whatever remains umerged consumes dedicated row. Re: ♠♠♠♦♦•◘How to slove this problem? bipartite graph maximum matching |
|
|