I am trying to solve the problem RENT on SPOJ. Here is the link http://www.spoj.com/problems/RENT/.I have done it using dynamic programming and binary search. I cant figure out what is wrong with my code.Here is a link to my code : http://ideone.com/UgnBRN . Please Help.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.12.2024 16:46:26 (j2).
Десктопная версия, переключиться на мобильную.
При поддержке
Are you taking into account that if a rent ends at time t, then the next one has to start at least at time t + 1 ???
The statement says otherwise, I know, but you can't start a rent at the same time you end the previous one. The statement is incorrect.
Found my error. :) I was doing ar[mm] and sometimes it was returning mm=-1. So that was showing garbage values. Thanks a ton :)
Well I solved this problem allowing to begin a rent at the same time another ends. I guess there is no case like that in the test cases...
There is a test case like that in SPOJ Toolkit, but perhaps not in the official test cases. In that case, the SPOJ Toolkit solution is wrong and the problem statement is right.