Общий форум @ Timus Online Judge

PLEASE HELP WITH 1115

Послано Arsen R. Arutunjan 24 сен 2001 23:15

PLEASE HELP!!!!
Anyone who have solved this rpoblem help me, say some idea
or tell some klever book, which I must read. PLEASE HELP!!!!

Complete Search. It take a litlle time.

Послано Vua moi chay xuong nha xem phim duoc 1 ty, len chung no da lam x 25 сен 2001 02:02

> PLEASE HELP!!!!
> Anyone who have solved this rpoblem help me, say some
idea
> or tell some klever book, which I must read. PLEASE
HELP!!!!

Re: Complete Search. It take a litlle time.--> Just use greedy algorithm, it's the fastest way.

Послано Tran Nam Trung (trungduck@yahoo.com) 25 сен 2001 15:09

> > PLEASE HELP!!!!
> > Anyone who have solved this rpoblem help me, say some
> idea
> > or tell some klever book, which I must read. PLEASE
> HELP!!!!

I think that the greedy algorythm wrong

Послано Andrey Popyk (popyk@ief.tup.km.ua) 28 сен 2001 19:01

In my opinion this is a multi-knapsack problem.
It is well known, than greedy algorythm fail for knapsack
problem.

Re: I think that the greedy algorythm wrong

Послано Tran Nam Trung (trungduck@yahoo.com) 28 сен 2001 20:17

I have acceptted this prob by greedy algorithm. I agree
with you that greedy algorithm is not good in some cases
but if you have a well greedy algorithm it can passes all
the test cases here.
mailto : trungduck@yahoo.com

> In my opinion this is a multi-knapsack problem.
> It is well known, than greedy algorythm fail for knapsack
> problem.
>
>