ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1431. Diplomas

♠♠♠♦♦•◘How to slove this problem?
Posted by temp5 29 Jun 2007 17:30
please help. Thanks
Simply DP...
Posted by Vedernikoff Sergey 29 Jun 2007 23:14
Re: Simply DP...
Posted by Paradox(Petrosian Alexander){RAU}~ 3 Jul 2007 15:32
Thanks. But I dont understand what is the DP.
May be you mean Brut Forse
Re: Simply DP...
Posted by CHIDEMYAN SERGEY 4 Jul 2007 00:42
DP means dinamic program.
Re: Simply DP...
Posted by Paradox(Petrosyan Alexandr){RAU}~ 1 Jun 2008 12:46
Thanks and best wishes! ==)
Re: Simply DP...
Posted by Denis Koshman 25 Jul 2008 17:57
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?
Posted by [York Hotel] maple 18 Apr 2011 11:18
bipartite graph maximum matching