To clarify (or not :):
Eg. sum( @sim[top..bottom; left..right] ) / (bottom-top) * (right-left); (pretending that we could do 2D slices).
Which would make the problem: Find the rectangular subset with the largest average value; and if two subsets have the same average, favour the largest subset?
In reply to Re: Finding The Best Cluster Problem
by BrowserUk
in thread Finding The Best Cluster Problem
by neversaint
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |