二次聯(lián)通門(mén) :?BZOJ 1567: [JSOI2008]Blue Mary的戰(zhàn)役地圖

?

?

?

?

/*BZOJ 1567: [JSOI2008]Blue Mary的戰(zhàn)役地圖社會(huì)我棟哥人慫P話多暴力能A題正解能WA0*/ #include <cstdio> #include <iostream>#define rg register inline void read (int &n) {rg char c = getchar ();for (n = 0; !isdigit (c); c = getchar ());for (; isdigit (c); n = n * 10 + c - '0', c = getchar ()); } #define Max 60 int a[Max][Max], b[Max][Max]; int main (int argc, char *argv[]) {int N; read (N); rg int i, j, k, x, y, z, c;for (i = 1; i <= N; ++ i) for (j = 1; j <= N; ++ j) read (a[i][j]);for (i = 1; i <= N; ++ i) for (j = 1; j <= N; ++ j) read (b[i][j]);for (i = N; i >= 1; -- i)for (j = 1; j <= N - i + 1; ++ j)for (k = 1; k <= N - i + 1; ++ k)for (x = 1; x <= N - i + 1; ++ x)for (y = 1; y <= N - i + 1; ++ y){for (z = 0; z < i; ++ z)for (c = 0; c < i; ++ c)if (a[j + z][k + c] != b[x + z][y + c]) goto Here;printf ("%d", i); return 0;Here : continue;} printf ("0"); return 0; }

?

轉(zhuǎn)載于:https://www.cnblogs.com/ZlycerQan/p/7592682.html

總結(jié)

以上是生活随笔為你收集整理的BZOJ 1567: [JSOI2008]Blue Mary的战役地图的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。