this is my solution http://ideone.com/49SCl3 for spoj problem
http://www.spoj.com/problems/MRECAMAN/en/
could anyone pls say why am i getting TLE
THANKS IN ADVANCE
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
this is my solution http://ideone.com/49SCl3 for spoj problem
http://www.spoj.com/problems/MRECAMAN/en/
could anyone pls say why am i getting TLE
THANKS IN ADVANCE
| Название |
|---|



find function work in O(N), try to use map or set to check if the new element is in the sequence or not.
I got AC using this code. ( link ) = the same as yours, but little modified. Method find in vector works in O(N). So, your solution was O(N*N). Set do the same in O(logn) time.