|
|
вернуться в форумI know there O(N^3) solution, but how to get 0.001s ?? There a[i][j] in [-127..127] and n <= 100 -- May be there bitmask tricks, or other tricks???? Re: I know there O(N^3) solution, but how to get 0.001s ?? There's one hard solution with quick matrix multiply |
|
|