2043.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2043 on 2006-06-02 at 16:31:04 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 400;
const int DIFF = 100;
const int DIR[][2] = { { 1, 1 }, { 1, -1 }, { -1, 1 }, { -1, -1 } };

int main()
{
	int img[2][N][N], n;
	int i, j, k;

	while(scanf("%d", &n) != EOF && n != 0) {
		for(k = 0; k < 2; k++)
			for(i = 0; i < n; i++)
				for(j = 0; j < n; j++) scanf("%d", &img[k][i][j]);
		int p[][2] = { { 0, 0 }, { 0, n-1 }, { n-1, 0 }, { n-1, n-1 } }, best = 0;
		for(k = 0; k < 4; k++) {
			int la = 0, lb = 0;
			for(i = 0; i < n; i++)
				for(j = 0; j < n; j++) {
					int x = p[k][0]+DIR[k][0]*i, y = p[k][1]+DIR[k][1]*j;
					if(abs(img[0][i][j]-img[1][x][y]) <= DIFF) la++;
					if(abs(img[0][j][i]-img[1][x][y]) <= DIFF) lb++;
				}
			best = max(best, max(la, lb));
		}
		printf("%.2lf\n", 100.0*best/(n*n));
	}
	
	return 0;
}