Image Overlap

Two images A and B are given, represented as binary, square matrices of the same size.  (A binary matrix has only 0s and 1s as values.)

We translate one image however we choose (sliding it left, right, up, or down any number of units), and place it on top of the other image.  After, the overlap of this translation is the number of positions that have a 1 in both images.

(Note also that a translation does not include any kind of rotation.)

What is the largest possible overlap?

Example 1:

Input: A = [[1,1,0],
            [0,1,0],
            [0,1,0]]
       B = [[0,0,0],
            [0,1,1],
            [0,0,1]]
Output: 3
Explanation: We slide A to right by 1 unit and down by 1 unit.

/* 计算两张图片经过平移后重合的1最多是多少
 * 注意移动后重合的位置发生变化 因此不能用dp
 * length<30 上暴力O(n^4) 900*900=810000 控制在百万应该OK
 * */
class Solution {
public:
    int largestOverlap(vector<vector<int>>& A, vector<vector<int>>& B) {
        return max(myIOU(A, B), myIOU(B, A));
    }
    int myIOU(vector<vector<int>>& A, vector<vector<int>>& B){//
        int len=A.size(), ret=0;
        // 固定A 移动B row,col是移动量
        for(int row=0;row<len;row++){
            for(int col=0;col<len;col++){
                int cnt=0;
                for(int i=row;i<len;i++){
                    for(int j=col;j<len;j++){
                        if(A[i][j]==1 && B[i-row][j-col]==1)    cnt++;
                    }
                }
                cout<<row<<" "<<col<<" "<<cnt<<endl;
                ret = max(ret, cnt);
            }
        }
        return ret;
    }
};