Yoda-Lang, 23 bytes
"Hello, World!" you say
I haven't figured out how to install Yoda-Lang so I can't tell if I can remove any spaces. I'll give another try at installing it soon, since this looks like a genuinely interesting language.
CMQ given an n by n matrix of integers I can find the diagonal line (going up and right) that partitions the matrix to maximise the sum of the numbers in the top left part. This takes the time linear in the size of the matrix. I can also find the radius of a circle with center at (0,0) which maximises the sum of the integers in the circle in the same time conplexity
But I want to do both. That is find a diagonal line and radius that maximises the sum of the integers that are up and left of both