Timeline for Time Limit Exceeded for CodeChef Easy problem - STRQ (Chef and Strings)
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2015 at 18:54 | history | edited | Jamal | CC BY-SA 3.0 |
deleted 31 characters in body; edited tags
|
| Feb 21, 2015 at 11:27 | answer | added | kraskevich | timeline score: 1 | |
| Feb 21, 2015 at 10:02 | comment | added | kraskevich |
You need to use a more efficient algorithm. What you have now is O(q * n) or even O(q * n * n) time in the worst case.
|
|
| Feb 21, 2015 at 9:37 | history | edited | Rohit Jain | CC BY-SA 3.0 |
edited title
|
| Feb 21, 2015 at 9:25 | history | asked | Rohit Jain | CC BY-SA 3.0 |