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
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 156 |
6 | adamant | 152 |
6 | djm03178 | 152 |
8 | Qingyu | 151 |
9 | luogu_official | 149 |
10 | awoo | 147 |
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
Name |
---|
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.