Discussion @ 1146. Maximum Sum @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1146. Maximum Sum

xurshid_n I know there O(N^3) solution, but how to get 0.001s ?? [1] // Problem 1146. Maximum Sum 7 Jan 2017 23:14

There a[i][j] in [-127..127] and n <= 100 -- May be there bitmask tricks, or other tricks????

HeredisStultus Re: I know there O(N^3) solution, but how to get 0.001s ?? // Problem 1146. Maximum Sum 7 Nov 2019 21:19

There's one hard solution with quick matrix multiply