Обсуждение @ 1431. Сертификаты @ Timus Online Judge

♠♠♠♦♦•◘How to slove this problem?

Послано temp5 29 июн 2007 17:30

please help. Thanks

Simply DP...

Послано Vedernikoff Sergey 29 июн 2007 23:14

Re: Simply DP...

Послано Paradox(Petrosian Alexander){RAU}~ 3 июл 2007 15:32

Thanks. But I dont understand what is the DP.
May be you mean Brut Forse

Re: Simply DP...

Послано CHIDEMYAN SERGEY 4 июл 2007 00:42

DP means dinamic program.

Re: Simply DP...

Послано Paradox(Petrosyan Alexandr){RAU}~ 1 июн 2008 12:46

Thanks and best wishes! ==)
☺

Re: Simply DP...

Послано Denis Koshman 25 июл 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?

Послано [York Hotel] maple 18 апр 2011 11:18

bipartite graph maximum matching

Обсуждение задачи 1431. Сертификаты