ENG  RUSTimus Online Judge
Online Judge
Задачи
Авторы
Соревнования
О системе
Часто задаваемые вопросы
Новости сайта
Форум
Ссылки
Архив задач
Отправить на проверку
Состояние проверки
Руководство
Регистрация
Исправить данные
Рейтинг авторов
Текущее соревнование
Расписание
Прошедшие соревнования
Правила
вернуться в форум

Обсуждение задачи 1115. Корабли

I don't know how to solve it.
Послано Sun-ho, Cho 29 дек 2001 06:44
I don't know how to solve this problem.
Give me some hints please.

Happy new year.
Me too at the first time.
Послано Huang Yizheng 29 дек 2001 12:48
If you want more details,you can email to "hyz12345678@163.com".
This is a NP problem
Послано Algorist 30 дек 2001 00:28
It is a "multi-knapsack", which is proved to be NP. So, use recursion
with some optimizations.

(NP = Non Polynomial) -> that means that there is no efficient
algorithm (well, not exactly that, but almost the same in this case)
Re: I agree with you. But to get AC is very easy.
Послано Revenger and NSC 30 дек 2001 16:41
Isn't complete search with a few optimizations enough? Or even, a greedy?
Послано Algorist 31 дек 2001 02:34
Re: I agree with you. But to get AC is very easy.
Послано Miguel Angel 31 дек 2001 09:29
> Could you help me?? mail:miguelangelhdz@hotmail.com, or here, i did
it, but get time limit exced :|