|
|
back to boardI have TLE#12 on C++ and TLE#10 on Pascal but my solution O(N^2*logN) Please help me.give me any test with TLE. Edited by author 11.03.2007 11:45 now I got AC!! I have the same problem. TLE. can anybody explain my O(N^2) algo? gsaghinadze@yahoo.com near O(N^2) algo is with use of hashing to avoid binary search. I'd used standard .net Dictionary<int, int> class for this, and got AC. |
|
|