题意:把一个n*m的矩阵分割成k*k的小正方型(如果矩阵不够大,自动向外补‘0’),我们可以把1->0,0->1。使小正方形里的元素要相同,问怎么最小次数的翻转能达到条件。
思路:用前缀和数组记录前i,j,矩形内有多少个1,枚举所有k。
AC代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 2510;
int num[5100][5100];
int n, m;
int main(){
while(scanf("%d%d",&n,&m)!=EOF){
memset(num, 0, sizeof(num));
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
scanf("%1d",&num[i][j]);
}
}
for(int i = 1; i <= max(n,m)*2; i++){
for(int j = 1; j <= max(n, m)*2; j++){
num[i][j] += num[i-1][j] + num[i][j-1] - num[i-1][j-1];
// printf("num = %d\n",num[i][j]);
}
}
int Min = 0x3f3f3f3f;
for(int k = 2; k <= max(n, m); k++){
int a = k * k, ans = 0;
for(int i = k; i-k <= n; i+=k){
for(int j = k; j-k <= m; j+=k){
int b = num[i][j] - num[i-k][j] - num[i][j-k] + num[i-k][j-k];
ans += min(b, a - b);
// printf("ans = %d, b = %d, Min = %d\n",ans, b, Min);
}
}
Min = min(ans, Min);
}
printf("%d\n",Min);
}
return 0;
}