|
|
back to boardTime Limit on #20 again. I understand that i am using bad algo. Please show the way to write good algo. Thanks Re: Time Limit on #20 again. Easy. Calculate the sum quickly using a[j]-a[i-1] where a[i] is sum of all elements from 1 to i. |
|
|