given a 2d(N*N) matrix...N<=5*10^3 ...maximize F(a,b,c,d)=A[a][b]+A[c][d] -|a-c|-|b-d| ...0<=A[i][j]<=10^9. output max value of F for (a,b) not equal to (c,d) i.e. 2 distinct points. i was only able to think of o(n^2)bruteforce hence TLEd :(
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | Hogwarts.dropout | 2022-06-16 06:45:44 | 418 | |||
en2 | Hogwarts.dropout | 2021-09-21 16:15:43 | 14 | Tiny change: ' think of o(n^2) hence TLE' -> ' think of bruteforce hence TLE' | ||
en1 | Hogwarts.dropout | 2021-09-20 20:23:39 | 275 | Initial revision (published) |