ZOJ 3528 Parterre

直接暴力枚举竟然过了.

#include <iostream>#include <cstdio>#include <cmath>#include <memory.h>using namespace std;const int maxn = 505;int mat[maxn][maxn], n, m, q;int cnt[maxn / 2];int main(){while (scanf("%d%d", &n, &m) == 2){memset(mat, 0, sizeof(mat));int bn = (int)ceil(min(n, m) / 2.0);for (int i = 1; i <= bn; ++i){int t;scanf("%d", &t);for (int j = i; j <= (n - i + 1); ++j){mat[j][i] = t;mat[j][m - i + 1] = t;}for (int j = i; j <= (m - i + 1); ++j){mat[i][j] = t;mat[n - i + 1][j] = t;}}scanf("%d",&q);while (q--){int l, r, t, b, maxc = 0, maxi = 0, maxv = 0,diff = 0;;scanf("%d%d%d%d", &t, &l, &b, &r);t++,l++,b++,r++;memset(cnt,0,sizeof(cnt));for (int i = t; i <= b; ++i){for (int j = l; j <= r; ++j){cnt[mat[i][j]]++;maxc = max(maxc, mat[i][j]);}}for (int i = 1; i <= maxc; ++i){if(cnt[i]){diff++;if(cnt[i] > maxv){maxv = cnt[i];maxi = i; }}}printf("%d %d %d\n", diff, maxi, maxv);}}}