|
|
back to boardShow all messages Hide all messages[code deleted] Edited by moderator 01.12.2019 21:45 I dont know java, therefore I may be mistake. Try to use binary search. I also using Java, but have AC with 0.25 s ans ~4.5 Mb Try to use array of array of partial sums. P.S. sorry for my bad English No Fenwick Tree, just summ[y] - summ[x-1]. |
|
|