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 | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 149 |
6 | SecondThread | 148 |
7 | Petr | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
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.