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 | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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.