拜托..这里是XP提问区..

于是跟上一个方案，接受批斗

1. 
   
2. def find_rect(total_width, total_height, rect_width, rect_height, events)
   
3. weight_array = Array.new(total_width * total_height){0}
   
4. events.each{|event| add_weight(event, rect_width, rect_height)}
   
5. max_index = weight_array.index weight_array.sort[-1]
   
6. return max_index % total_width + 1, max_index / total_width + 1
   
7. end
   
8. def add_weight(event, rect_width, rect_height)
   
9. index = event.x * total_width + event.y
   
10. for i in 0...rect_width
    
11. for j in 0...rect_height
    
12. arr[index - i - j * total_width] += 1
    
13. end
    
14. end
    
15. end

复制代码

算法思路：
构建各个初始点【将该点作为矩形左上点】的权重数组weight_array，并初始化所有元素为0；
迭代每一个事件，将被迭代事件作为矩形右下角，加成权重数组的元素；
取出权重数组的最大值索引，对total_width取余加1为x，除以total_width加1得到y