{"id":396,"date":"2024-11-27T20:44:31","date_gmt":"2024-11-27T12:44:31","guid":{"rendered":"https:\/\/www.nenuacm.top\/?p=396"},"modified":"2024-11-30T00:35:21","modified_gmt":"2024-11-29T16:35:21","slug":"nenuoj-%e4%b9%8b-%e7%ae%97%e6%b3%952%e6%90%9c%e7%b4%a2e%ef%bc%88%e6%9b%b4%e6%96%b0ing%ef%bc%89","status":"publish","type":"post","link":"https:\/\/www.nenuacm.top\/index.php\/2024\/11\/27\/nenuoj-%e4%b9%8b-%e7%ae%97%e6%b3%952%e6%90%9c%e7%b4%a2e%ef%bc%88%e6%9b%b4%e6%96%b0ing%ef%bc%89\/","title":{"rendered":"NENUOJ \u4e4b \u7b97\u6cd52\u641c\u7d22E"},"content":{"rendered":"\n

\u524d\u8a00<\/h2>\n\n\n\n
\n

\u8fd9\u4e00\u7ae0\u662f\u641c\u7d22\u76f8\u5173\uff0c\u641c\u7d22\u9700\u8981\u6709\u5f88\u5f3a\u7684\u201c\u8f6c\u79fb\u201d\u7684\u610f\u8bc6\uff0c\u4f60\u8981\u80fd\u628a\u9898\u76ee\u53d8\u6210\u4e00\u9897\u201c\u6811\u201d\uff0c\u7136\u540e\u5728\u8fd9\u68f5\u201d\u6811\u201c\u4e0a\u5b8c\u6210\u4f60\u7684\u641c\u7d22\u3002<\/p>\n\n\n\n

\u641c\u7d22\u548c\u52a8\u6001\u89c4\u5212\u662f\u76f8\u4f3c\u7684\uff0c\u60f3\u529e\u6cd5\u5206\u7c7b\u8ba8\u8bba+\u5206\u89e3\u5427~<\/p>\n<\/blockquote>\n\n\n\n

E001 \u6570\u7684\u5212\u5206<\/a><\/h2>\n\n\n\n
\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n

\u5c06\u6574\u6570n\u5206\u6210k\u4efd\uff0c\u4e14\u6bcf\u4efd\u4e0d\u80fd\u4e3a\u7a7a\uff0c\u4efb\u610f\u4e24\u79cd\u5206\u6cd5\u4e0d\u80fd\u76f8\u540c\uff08\u4e0d\u8003\u8651\u987a\u5e8f\uff09\u3002 \u4f8b\u5982\uff1an=7\uff0ck=3\uff0c\u4e0b\u9762\u4e09\u79cd\u5206\u6cd5\u88ab\u8ba4\u4e3a\u662f\u76f8\u540c\u7684\u3002 1,1,5\uff1b1,5,1\uff1b5,1,1\uff1b \u95ee\u6709\u591a\u5c11\u79cd\u4e0d\u540c\u7684\u5206\u6cd5\u3002<\/p>\n\n\n\n

\u8f93\u5165<\/h4>\n\n\n\n

\u6bcf\u7ec4\u6570\u636e\u7531\u4e00\u884c\u4e0a\u76842\u4e2a\u6574\u6570n\uff0ck\u6784\u6210\uff086<n\u2264200,2\u2264k\u22646\uff09\u3002<\/p>\n\n\n\n

\u8f93\u51fa<\/h4>\n\n\n\n

\u5bf9\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u4e0d\u540c\u7684\u5206\u6cd5\u6574\u6570\u3002<\/p>\n\n\n\n

\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
7 3<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
4<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u6211\u4eec\u8981\u600e\u4e48\u641c\u7d22\u5462\uff1f<\/p>\n\n\n\n
\u641c\u7d22\u5176\u5b9e\u6211\u4eec\u901a\u5e38\u6700\u57fa\u672c\u6700\u5165\u95e8\u7684\u505a\u6cd5\uff0c\u5c31\u662f\u679a\u4e3e\u6240\u6709\u7684\u60c5\u51b5\u3002<\/p>\n\n\n\n
\u679a\u4e3e\u5c31\u662f\u641c\u7d22\u7684\u5165\u95e8\uff01\u6211\u4eec\u53ef\u4ee5\u60f3\u529e\u6cd5\u679a\u4e3e\u6240\u6709\u60c5\u51b5\uff01<\/p>\n\n\n\n
\u6bd4\u5982\u679a\u4e3e7\u5206\u62103\u4efd\uff0c\u6211\u4eec\u679a\u4e3e1 1 5\u30011 2 4\u30011 3 3\u30012 2 3\u8fd9\u56db\u79cd\u60c5\u51b5\u3002\u540c\u65f6\u6211\u4eec\u4fdd\u8bc1\u8fd9\u51e0\u4e2a\u6570\u5b57\u662f\u4e00\u4e2a\u6bd4\u4e00\u4e2a\u5927\uff08\u5927\u4e8e\u7b49\u4e8e\uff09\u5c31\u4e0d\u4f1a\u51fa\u73b0\u91cd\u590d\u7684\u60c5\u51b5\u3002<\/p>\n\n\n\n
\u4e5f\u5c31\u662f\u4ec0\u4e48\uff0c\u6211\u4eec\u6bcf\u4e2a\u6570\u5b57\u90fd\u53ef\u4ee5\u57281 ~ 7\u4e4b\u95f4\u679a\u4e3e\u3010\u4e5f\u5c31\u662f1~n\u3011\uff0c\u540c\u65f6\u8fd93\u4e2a\u6570\u5b57\u3010\u4e5f\u5c31\u662f\u8fd9k\u4e2a\u6570\u5b57\u3011\u8981\u6ee1\u8db3\u540e\u4e00\u4e2a\u5927\u4e8e\u7b49\u4e8e\u524d\u4e00\u4e2a\u3010\u4fdd\u8bc1\u4e0d\u91cd\u590d\u3011\u3002<\/p>\n\n\n\n
\u6240\u4ee5\u6211\u4eec\u53ef\u4ee5\u5199\u4e00\u4e2aDFS\uff0c\u8bb0\u5f55\u6211\u4eec\u679a\u4e3e\u5230\u4e86\u7b2c\u51e0\u4e2a\u6570\u5b57\uff0c\u548c\u524d\u4e00\u4e2a\u6570\u5b57\u7684\u503c\u3010start\u7528\u6765\u8ba9\u4e0b\u4e00\u4e2a\u6570\u5b57\u4e0d\u4f1a\u5c0f\u4e8e\u524d\u4e00\u4e2a\u6570\u5b57\u3011\u4ee5\u53ca\u6240\u6709\u6570\u5b57\u4e4b\u548c\uff0c\u8ba9\u6211\u4eec\u6700\u540e\u7684\u548c\u53ef\u4ee5\u662fn\uff0c\u5e76\u4e14\u786e\u5b9e\u9012\u5f52\u4e86k\u6b21\u3010\u4e5f\u5c31\u662f\u5212\u5206\u4e86k\u6b21\u3011<\/p>\n\n\n\n
\u52a8\u6001\u89c4\u5212\u7684\u601d\u8def\uff1a<\/p>\n\n\n\n
\u5176\u5b9e\u6211\u4eec\u53ef\u4ee5\u5206\u7c7b\u8ba8\u8bba\u51fa\u4e24\u79cd\u60c5\u51b5\uff0c\u4e00\u4e2a\u5c31\u662f \u8fd9k\u4e2a\u76d8\u5b50\u91cc\u81f3\u5c11\u6709\u4e00\u4e2a\u76d8\u5b50\u662f1 \u548c \u8fd9k\u4e2a\u76d8\u5b50\u91cc\u6ca1\u67091\uff08\u90fd\u662f\u5927\u4e8e1\u7684\uff09<\/p>\n\n\n\n
\u6211\u4eec\u7528 $f[i][j]$ \u8868\u793a\u5c06 $i$ \u62c6\u5206\u6210 $j$ \u4efd\u7684\u65b9\u6848\u6570\uff0c\u90a3\u4e48\u6211\u4eec\u5c31\u53ef\u4ee5\u628a\u8fd9\u4e2a\u62c6\u6210\u4e24\u90e8\u5206\uff0c\u5373 $f[i – 1][j – 1]$ \u3010\u8fd9\u662f\u81f3\u5c11\u67091\u4e2a\u76d8\u5b50\u662f1\uff0c\u6240\u4ee5\u5176\u4ed6 $j – 1$ \u4e2a\u76d8\u5b50\u91cc\u653e\u7684\u5c31\u662f $i-1$ \u4e2a\uff0c\u8fd8\u6709 $f[i – j][j]$ \u3010\u8fd9\u662f\u5148\u7ed9\u6bcf\u4e2a\u76d8\u5b50\u90fd\u5148\u653e\u4e861\u4e2a\uff0c\u4e5f\u5c31\u662f\u5c11\u4e86 $j$ \u4e2a\uff0c\u5269\u4e0b $i-j$ \u4e2a\uff0c\u5212\u5206\u7ed9 $j$ \u4e2a\u76d8\u5b50\u3002<\/p>\n\n\n\n
\u6240\u4ee5\u603b\u800c\u8a00\u4e4b\uff0c$f[i][j] = f[i-1][j-1] + f[i-j][j]$\u3002<\/p>\n\n\n\n
\u4f46\u662f\u5982\u679c i < j \u7684\u65f6\u5019\uff0c\u6211\u4eec\u4e0d\u5b58\u5728\u8fd9\u79cd\u60c5\u51b5\u3010\u9898\u76ee\u4fdd\u8bc1\u4e86\u6570\u5b57\u8981\u6bd4\u5212\u5206\u6570\u591a\u3011\uff0c\u6240\u4ee5\u8d4b\u503c\u4e3a0\u5c31\u597d\u3002\u3010\u6216\u8005\u4e0d\u7ba1\u3011<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++ DFS\u7248\u672c\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint n,k;\nint cnt = 0;\n\n\/\/ dfs\u7528\u6765\u9012\u5f52\u679a\u4e3e\u6bcf\u4e00\u79cd\u5206\u6cd5\nvoid dfs(int level,int start,int sum) {\n    \/\/ \u5982\u679c\u5df2\u7ecf\u5206\u6210\u4e86k\u4efd\n    if (level == k) {\n        \/\/ \u786e\u4fdd\u6240\u6709\u5206\u7684\u603b\u548c\u7b49\u4e8en\n        if (sum == n) {\n            cnt++;\n        }\n        return;\n    }\n    \n    \/\/ \u4ecestart\u5f00\u59cb\uff0c\u679a\u4e3e\u6bcf\u4e2a\u53ef\u80fd\u7684\u5206\u6570\u3010start\u4fdd\u8bc1\u4e86\u540e\u4e00\u4e2a\u6570\u5927\u4e8e\u7b49\u4e8e\u524d\u4e00\u4e2a\u6570\u3011\n    for (int i = start;i <= n - sum;i++) {\n        dfs(level + 1,i,sum + i);\n    }\n}\n\nint main() {\n    cin >> n >> k;\n    dfs(0,1,0); \/\/ \u4ece\u7b2c0\u5c42\u5f00\u59cb\uff0c\u8d77\u59cb\u6570\u5b57\u4e3a1\uff0c\u521d\u59cb\u548c\u4e3a0\n    cout << cnt << \"\\n\";\n    return 0;\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801C++ dp\u7248\u672c\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\n\nint f[201][201]; \/\/ f[i][j] \u8868\u793a\u5c06 i \u62c6\u5206\u6210 j \u4efd\u7684\u65b9\u6848\u6570\n\nint main() {\n    int n,k;\n    cin >> n >> k;\n\n    for (int i = 1;i <= n;i++) {\n        \/\/ \u5c06 i \u62c6\u6210 1 \u4efd\uff0c\u53ea\u6709\u4e00\u79cd\u65b9\u6cd5\uff0c\u5c31\u662f i \u672c\u8eab\n        f[i][1] = 1;\n    }\n\n    for (int i = 1; i <= n; i++) {\n        for (int j = 2; j <= k; j++) {\n            if (i >= j) {\n                \/\/ \u5982\u679c i >= j\uff0c\u624d\u6709\u53ef\u80fd\u5c06 i \u62c6\u6210 j \u4efd\n                f[i][j] = f[i-1][j-1] + f[i-j][j];\n            } else {\n                \/\/ \u5982\u679c i < j\uff0c\u53ea\u80fd\u62c6\u6210 j-1 \u4efd\n                \/\/ \u8fd9\u91cc\u5199\u4e0d\u5199\u90fd\u884c\n                f[i][j] = 0;\n            }\n        }\n    }\n\n    \/\/ \u5c06 n \u62c6\u6210 k \u4efd\u7684\u4e0d\u540c\u5206\u6cd5\u6570\n    cout << f[n][k] << \"\\n\";\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
E002 \u95ea\u907f\u6e56\u6cca<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u519c\u592b\u7ea6\u7ff0\u7684\u519c\u573a\u5728\u6700\u8fd1\u7684\u4e00\u573a\u66b4\u98ce\u96e8\u4e2d\u88ab\u6c34\u6df9\u6ca1\u3002\u4f46\u4fdd\u9669\u516c\u53f8\u4ec5\u6839\u636e\u4ed6\u5f97\u519c\u573a\u4e2d\u6700\u5927\u7684\u201c\u6e56\u6cca\u201d\u7684\u5927\u5c0f\u8d54\u507f\u4e00\u4e2a\u6570\u989d\u3002 \u519c\u573a\u53ef\u8868\u793a\u4e3aN\u884cM\u5217\u7684\u957f\u65b9\u5f62\u7f51\u683c\uff0c\uff081\u2264N\u2264100,1\u2264M\u2264100\uff09\u3002\u7f51\u683c\u4e2d\u7684\u6bcf\u4e2a\u5355\u5143\u6216\u662f\u5e72\u7684\u6216\u662f\u88ab\u6df9\u6ca1\u7684\uff0c\u4e14\u6070\u6709K\u4e2a\u5355\u5143\u88ab\u6c34\u6df9\u6ca1\uff0c\uff081\u2264K\u2264N*M\uff09\u3002\u6b63\u5982\u4eba\u4eec\u6240\u5e0c\u671b\u7684\uff0c\u6e56\u6cca\u662f\u4e00\u4e2a\u4e2d\u95f4\u5355\u5143\uff0c\u5b83\u4e0e\u5176\u4ed6\u7684\u5355\u5143\u5171\u4eab\u4e00\u6761\u957f\u8fb9\uff08\u4e0d\u662f\u89d2\u843d\uff09\u3002\u4efb\u4f55\u4e0e\u4e2d\u95f4\u5355\u5143\u5171\u4eab\u4e00\u6761\u957f\u8fb9\u6216\u8005\u4e0e\u8fde\u901a\u5355\u5143\u5171\u4eab\u4e00\u6761\u957f\u8fb9\u7684\u5355\u5143\u662f\u4e00\u4e2a\u8fde\u901a\u5355\u5143\uff0c\u662f\u6e56\u6cca\u7684\u4e00\u90e8\u5206\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u6709\u591a\u7ec4\u6570\u636e\u3002\u6bcf\u7ec4\u7684\u7b2c1\u884c\u67093\u4e2a\u6574\u6570N\uff0cM\u548cK\u3002\u7b2c2\u884c\u5230\u7b2cK+1\u884c\uff0c\u662f\u6574\u6570R\u548cC\uff0c\u8868\u793a\u88ab\u6df9\u6ca1\u7684\u4f4d\u7f6e\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u6709\u6700\u5927\u6e56\u6cca\u7684\u5355\u5143\u7684\u6570\u76ee\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
3 4 5
3 2
2 2
3 1
2 3
1 1<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
4<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u76f8\u5f53\u7ecf\u5178\u7684\u4e00\u9053DFS\u9898\u76ee\uff0c\u6211\u4eec\u5c31\u4ece\u6bcf\u4e2a\u6e56\u6cca\u4e0a\u4e0b\u5de6\u53f3\u5730\u53bb\u641c\u7d22\u5c31\u597d\u4e86\u3002<\/p>\n\n\n\n
\u4e0b\u65b9\u7684\u4ee3\u7801\u662f\u975e\u5e38\u6807\u51c6\u7684DFS\uff0c\u8bfb\u8005\u4e00\u5b9a\u8981\u8ba4\u771f\u5b66\u4e60~<\/p>\n\n\n\n
\u6211\u4eec\u7684\u601d\u8def\u662f\u627e\u5230\u6700\u5927\u7684\u6e56\u6cca\uff0c\u6211\u4eec\u5047\u8bbe\u7528\u6570\u7ec4\u5b58\u50a8\u8fd9\u4e2a\u56fe\uff0c\u6700\u5927\u7684\u6e56\u6cca\u5c31\u662f\u88ab\u6211\u4eec\u6807\u6ce8\u4e3a1\u6700\u591a\u7684\u5730\u65b9\u3002<\/p>\n\n\n\n
\u6211\u4eec\u5c31\u4ece\u4e00\u4e2a\u6e56\u6cca\u70b9\u5f00\u59cb\uff0c\u4e0a\u4e0b\u5de6\u53f3\u5730\u5bfb\u627e\u5176\u4ed6\u6e56\u6cca\u683c\u5b50\uff0c\u627e\u52301\u4e2a\u5c31\u52a01\uff0c\u5982\u679c\u662f\u8d8a\u754c\u3001\u53d1\u73b0\u4e0d\u662f\u6e56\u6cca\u683c\u5b50\u5c31\u52a00\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint mx[1001][1001];\nint n,m,k;\nint dfs(int x,int y){\n    if(x == 0 || y == 0 || x == n + 1 || y == m + 1 || mx[x][y] == 0) return 0;\n    if(mx[x][y]){\n        mx[x][y] = 0;\n        return 1 + dfs(x - 1,y) + dfs(x + 1,y) + dfs(x,y + 1) + dfs(x,y - 1);\n    }\n}\nint main(){\n    \n    while(cin >> n >> m >> k){\n        int r,c;\n        memset(mx,0,sizeof(mx));\n        for(int i = 2;i <= k + 1;i++){\n            cin >> r >> c;\n            mx[r][c] = 1;\n        }\n        int maxx = 0;\/\/ \u8bb0\u5f55\u6700\u5927\u503c\n        for(int i = 1;i <= n;i++){\n            for(int j = 1;j <= m;j++){\n                if(mx[i][j]){\n                    int cnt = dfs(i,j);\n                    maxx = max(cnt,maxx);\n                }\n            }\n        }\n        cout << maxx << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
E003 \u4fe1\u9053\u5206\u914d<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5f53\u65e0\u7ebf\u7535\u53f0\u5728\u4e00\u4e2a\u975e\u5e38\u5927\u7684\u533a\u57df\u4e0a\u4f20\u64ad\u4fe1\u53f7\u65f6\uff0c\u4e3a\u4e86\u6bcf\u4e2a\u63a5\u6536\u5668\u90fd\u80fd\u5f97\u5230\u8f83\u5f3a\u4fe1\u53f7\uff0c\u4f7f\u7528\u8f6c\u53d1\u5668\u8f6c\u53d1\u4fe1\u53f7\u3002\u7136\u800c\uff0c\u9700\u8981\u4ed4\u7ec6\u5730\u9009\u62e9\u6bcf\u4e2a\u8f6c\u53d1\u5668\u4f7f\u7528\u7684\u9891\u9053\uff0c\u4ee5\u4f7f\u9644\u8fd1\u7684\u8f6c\u53d1\u5668\u4e0d\u5f7c\u6b64\u5e72\u6270\u3002\u5982\u679c\u90bb\u8fd1\u7684\u8f6c\u53d1\u5668\u4f7f\u7528\u4e0d\u540c\u7684\u9891\u9053\uff0c\u6761\u4ef6\u5c31\u5f97\u5230\u6ee1\u8db3\u3002 \u56e0\u4e3a\u65e0\u7ebf\u7535\u6ce2\u7684\u9891\u8c31\u662f\u5b9d\u8d35\u7684\u8d44\u6e90\uff0c\u8f6c\u53d1\u5668\u6240\u9700\u9891\u9053\u7684\u6570\u91cf\u5e94\u51cf\u5230\u6700\u5c11\u3002\u7f16\u7a0b\u4efb\u52a1\uff1a\u8bfb\u53d6\u8f6c\u53d1\u5668\u7f51\u7edc\u7684\u63cf\u8ff0\u4fe1\u606f\uff0c\u5e76\u8ba1\u7b97\u51fa\u6240\u9700\u9891\u9053\u7684\u6700\u5c0f\u4f7f\u7528\u91cf\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u542b\u8bb8\u591a\u8f6c\u53d1\u5668\u7f51\u7edc\u56fe\u3002\u6bcf\u5e45\u56fe\u7684\u7b2c\u4e00\u884c\u662f\u8f6c\u53d1\u5668\u6570\u76ee\uff081~26\uff09\u3002\u8f6c\u53d1\u5668\u7528\u8fde\u7eed\u7684\u5927\u5199\u5b57\u6bcd\u8868\u793a\uff0c\u4eceA\u5f00\u59cb\u3002\u4f8b\u5982\uff0c10\u4e2a\u8f6c\u53d1\u5668\u7684\u540d\u79f0\u5206\u522b\u662fA\uff0cB\uff0cC\uff0c\u2026\uff0cI\u548cJ\u3002\u5f53\u8f6c\u53d1\u5668\u7684\u4e2a\u6570\u662f0\u65f6\uff0c\u8868\u793a\u8f93\u5165\u7ed3\u675f\u3002 \u8f6c\u53d1\u5668\u6570\u76ee\u4e4b\u540e\uff0c\u662f\u5176\u90bb\u8fd1\u5173\u7cfb\u7684\u5217\u8868\u3002\u6bcf\u884c\u7684\u683c\u5f0f\u4e3a A\uff1aBCDH \u8868\u793a\u8f6c\u53d1\u5668B\u3001C\u3001D\u548cH\u4e0e\u8f6c\u53d1\u5668A\u90bb\u8fd1\u3002\u7b2c\u4e00\u884c\u63cf\u8ff0\u4e0e\u8f6c\u53d1\u5668A\u90bb\u8fd1\u7684\uff0c\u7b2c\u4e8c\u884c\u63cf\u8ff0\u4e0eB\u90bb\u8fd1\u7684\uff0c\u76f4\u5230\u63cf\u8ff0\u5b8c\u6240\u6709\u7684\u8f6c\u53d1\u5668\u3002\u5982\u679c\u67d0\u4e2a\u8f6c\u53d1\u5668\u4e0d\u4e0e\u5176\u4ed6\u8f6c\u53d1\u5668\u76f8\u90bb\uff0c\u5b83\u7684\u5f62\u5f0f\u4e3a A\uff1a \u8f6c\u53d1\u5668\u4f9d\u5b57\u6bcd\u987a\u5e8f\u5217\u51fa\u3002 \u6ce8\u610f\uff1a\u76f8\u90bb\u662f\u5bf9\u79f0\u7684\u5173\u7cfb\uff1b\u5982\u679cA\u4e0eB\u76f8\u90bb\uff0c\u90a3\u4e48B\u4e0eA\u4e5f\u76f8\u90bb\u3002\u56e0\u4e3a\u8f6c\u53d1\u5668\u4f4d\u4e8e\u6c34\u5e73\u9762\u5185\uff0c\u7531\u76f8\u90bb\u7684\u8f6c\u53d1\u5668\u6784\u6210\u7684\u7f51\u7edc\u56fe\u6ca1\u6709\u76f8\u4ea4\u7684\u7ebf\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u5e45\u56fe\uff08\u9664\u4e86\u6700\u540e\u4e00\u4e2a\u6ca1\u6709\u8f6c\u53d1\u5668\uff09\uff0c\u8f93\u51fa\u4e00\u884c\uff0c\u662f\u8f6c\u53d1\u5668\u4e0d\u4e92\u76f8\u5e72\u6270\u6240\u9700\u7684\u6700\u5c11\u9891\u9053\u6570\u3002\u8f93\u51fa\u683c\u5f0f\u53c2\u8003\u6837\u4f8b\u8f93\u51fa\u3002\u6ce8\u610f\uff1a\u9891\u9053\u6570\u4e3a1\u7684\u8bdd\uff0c\u201cchannel\u201d\u4e3a\u5355\u6570\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u9996\u5148\u6211\u4eec\u8981\u80fd\u8bfb\u61c2\u9898\u76ee\u3002<\/p>\n\n\n\n
\u8fd9\u9053\u9898\u7684\u542b\u4e49\u662f\uff0c\u6709\u5f88\u591a\u4e2a\u5730\u533a\uff0c\u6211\u4eec\u53ef\u4ee5\u53eb\u505aABCD\uff0c\u7136\u540e\u7ed9\u6bcf\u4e2a\u5730\u533a\u5206\u914d\u4e00\u4e2a\u9891\u9053\uff0c\u4f46\u662f\u76f8\u90bb\u7684\u5730\u533a\u4e0d\u80fd\u662f\u76f8\u540c\u7684\u9891\u9053\u3002<\/p>\n\n\n\n
\u5982\u679c\u5b66\u4e60\u8fc7\u56db\u8272\u731c\u60f3\uff08\u56db\u8272\u5b9a\u7406\uff09\u3010\u8bfb\u8005\u5982\u679c\u542c\u4e86\u8bfe\u7684\u8bdd\u3011\uff0c\u5c31\u80fd\u77e5\u9053\uff0c\u6211\u4eec\u6700\u591a\u9700\u89814\u4e2a\u9891\u9053\uff0c\u5c31\u53ef\u4ee5\u8ba9\u6bcf\u4e2a\u5730\u533a\u7684\u9891\u9053\u90fd\u4e0d\u4f1a\u548c\u90bb\u5c45\u5730\u533a\u4eec\u7684\u76f8\u540c\u3002\u3010\u5c31\u597d\u50cf\u5730\u56fe\u53ef\u4ee5\u53ea\u75284\u4e2a\u989c\u8272\u6765\u8868\u793a\uff0c\u800c\u4e0d\u4f1a\u51fa\u73b0\u6709\u4e24\u4e2a\u76f8\u90bb\u7684\u5730\u533a\u662f\u540c\u79cd\u989c\u8272\u4e00\u6837\u3011<\/p>\n\n\n\n
\u8fd9\u4e2a\u8bfb\u5165\u662f\u7c7b\u4f3c\u4e8e\u90bb\u63a5\u8868\u7684\u7ed3\u6784\uff0c\u4e5f\u5c31\u662f\u6bcf\u4e00\u884c\u5f00\u5934\u7684\u7b2c\u4e00\u4e2a\u662f\u4e00\u4e2a\u70b9\uff0c\u7136\u540e\u540e\u9762\u8ddf\u7740\u4ed6\u7684\u5404\u4e2a\u90bb\u5c45\u70b9\u3002<\/p>\n\n\n\n
\u90a3\u6211\u4eec\u73b0\u5728\u77e5\u9053\u6700\u591a\u75284\u4e2a\u9891\u9053\u5c31\u80fd\u89e3\u51b3\u95ee\u9898\uff0c\u6240\u4ee5\u6211\u4eec\u5c31\u5f97\u5206\u7c7b\u8ba8\u8bba\uff0c\u770b\u770b\u4ec0\u4e48\u65f6\u5019\u662f1\u4e2a\u30012\u4e2a\u30013\u4e2a\u30014\u4e2a\u9891\u9053\u3002<\/p>\n\n\n\n
\u5982\u679c\u60f3\u8981\u53ea\u67091\u4e2a\u9891\u9053\u7684\u8bdd\uff0c\u90a3\u8bf4\u660e\u5b8c\u5168\u6ca1\u6709\u4efb\u4f55\u70b9\u76f8\u90bb\u3010\u8bfb\u8005\u53ef\u4ee5\u81ea\u5df1\u60f3\u60f3\uff0c\u5982\u679c\u6709\u70b9\u76f8\u90bb\uff0c\u90a3\u8fd9\u4e24\u4e2a\u70b9\u5c31\u4e0d\u80fd\u662f\u540c\u4e2a\u9891\u9053\uff0c\u90a3\u5c31\u81f3\u5c11\u67092\u4e2a\u9891\u9053\u624d\u662f\u3011\uff0c\u6240\u4ee5\u8fd9\u4e2a\u7279\u5224\u5f88\u597d\u5224\u65ad\u3002<\/p>\n\n\n\n
\u91cd\u70b9\u662f\u5982\u4f55\u5224\u65ad\u67092\u30013\u30014\u4e2a\u9891\u9053\u5462\uff1f<\/p>\n\n\n\n
\u6211\u4eec\u8fd8\u662f\u53bb\u641c\u7d22\uff01\u8fd8\u8bb0\u5f97\u7b14\u8005\u524d\u9762\u63d0\u5230\u7684\uff0c\u641c\u7d22\u7684\u5165\u95e8\u5c31\u662f\u679a\u4e3e\u6240\u6709\u60c5\u51b5\u3002\u6211\u4eec\u628a\u6bcf\u4e2a\u70b9\u662f\u4ec0\u4e48\u9891\u9053\u90fd\u679a\u4e3e\u4e00\u6b21\u5176\u5b9e\u5c31\u80fd\u89e3\u51b3\u95ee\u9898\u3002<\/p>\n\n\n\n
\u6211\u4eec\u5b58\u56fe\u8fd9\u90e8\u5206\u4e0d\u8be6\u7ec6\u8bb2\uff0c\u7b80\u5355\u6765\u8bf4\u5c31\u662f\u628a\u8fd9\u4e9b\u70b9ABCD\u53d8\u6210\u6570\u5b571234\uff0c\u7136\u540e\u7528\u4e8c\u7ef4\u6570\u7ec4\u5b58\u50a8\u4ed6\u4eec\u4e4b\u95f4\u7684\u5173\u7cfb\uff0c\u5982\u679c\u6709\u8fb9\uff0c\u5c31\u662f1\uff0c\u5426\u5219\u5c31\u662f0\u3002\u3010\u8bb0\u5f97\u6e05\u7a7a\u6570\u7ec4\u3011<\/p>\n\n\n\n
DFS\u7684\u90e8\u5206\u662f\u6838\u5fc3\u548c\u91cd\u70b9\uff0c\u6211\u4eec\u6bcf\u6b21\u5047\u8bbe\u6709colors\u79cd\u9891\u9053\uff0c\u7136\u540e\u770b\u770b\u80fd\u4e0d\u80fd\u679a\u4e3e\u5230\u4e00\u79cd\u5408\u6cd5\u60c5\u51b5\u3002<\/p>\n\n\n\n
\u6211\u4eec\u7ed9\u5f53\u524d\u5728\u5173\u6ce8\u7684\u70b9\u5206\u914d\u4e00\u79cd\u9891\u9053\uff0c\u7136\u540e\u6211\u4eec\u5728\u53bb\u770b\u770b\u4ed6\u7684\u90bb\u5c45\u70b9\u662f\u5426\u90fd\u80fd\u6ee1\u8db3\u3001\u4e0d\u51b2\u7a81\uff0c\u5982\u679c\u51b2\u7a81\uff0c\u6211\u4eec\u5c31\u518d\u6362\u4e00\u79cd\u9891\u9053\u8bd5\u8bd5\u3002<\/p>\n\n\n\n
\u4e3a\u4e86\u9632\u6b62\u5224\u65ad\u91cd\u590d\u3001\u8d70\u4e00\u4e9b\u91cd\u590d\u7684\u8001\u8def\uff0c\u6211\u4eec\u6bcf\u6b21\u627e\u7684\u90bb\u5c45\u70b9\u90fd\u4ece\u6bd4\u8fd9\u4e2a\u70b9\u5c0f\u7684\u90a3\u4e9b\u70b9\u91cc\u627e\u3002<\/p>\n\n\n\n
\u5982\u679c\u6211\u4eec\u4e00\u8def\u4ece\u70b91\u8d70\u5230\u70b9n\uff0c\u4e5f\u5c31\u662f\u4e00\u8def\u4ece\u7b2c\u4e00\u4e2a\u70b9\u5230\u6700\u540e\u4e00\u4e2a\u70b9\u90fd\u679a\u4e3e\u5b8c\u6210\uff0c\u5e76\u4e14\u6ca1\u6709\u51fa\u73b0\u4efb\u4f55\u95ee\u9898\u5728\u4e2d\u9014\u7684\u90a3\u4e9b\u70b9\u4e2d\u3002<\/p>\n\n\n\n
\u5177\u4f53\u8bf7\u770b\u4ee3\u7801~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint n;\nint mx[100][100];\nint color[100];\n\/\/ \u5f53\u524d\u679a\u4e3e\u5230u\u70b9\uff0c\u5047\u8bbe\u603b\u5171\u6709colors\u79cd\u9891\u9053\nint dfs(int u,int colors){\n    for(int i = 1;i <= colors;i++){\n        int flag = 1; \/\/ flag\u4e3a1\u5c31\u662f\u5047\u8bbe\u5f53\u524d\u8fd9\u4e2a\u9891\u9053i\u662f\u6210\u7acb\u7684\n        color[u] = i; \/\/ \u5047\u8bbeu\u70b9\u7684\u9891\u9053\u662fi\n        for(int v = 1;v < u;v++){\n            \/\/ \u5982\u679cv\u70b9\u76f8\u90bb\u4e14\u9891\u9053\u76f8\u540c\uff0c\u8bf4\u660e\u8fd9\u6761\u8def\u8d70\u4e0d\u901a\n            if(mx[u][v] && color[u] == color[v]){\n                flag = 0; \/\/ u\u7684\u8fd9\u4e2a\u9891\u9053\u4e0d\u6210\u7acb\n                break;\n            }\n        }\n        \/\/ \u5982\u679c\u8fd9\u6761\u8def\u6ca1\u9047\u5230\u95ee\u9898\uff0c\u5e76\u4e14\u6211\u4eec\u5df2\u7ecf\u5728\u6700\u540e\u4e00\u6bb5\u8def\n        \/\/ \u6216\u8005\u8bf4\n        \/\/ \u5982\u679c\u6211\u4eec \u4ece\u6765 \u6ca1\u9047\u5230\u95ee\u9898\uff0c\u540c\u65f6\u5df2\u7ecf\u904d\u5386\u5230\u6700\u540e\u4e00\u4e2a\u70b9\u7684\u60c5\u51b5\n        \/\/ \u90a3\u4e48\u6211\u4eec\u5c31\u5df2\u7ecf\u627e\u5230\u4e86\u7b54\u6848\n        if(flag && (u == n || dfs(u + 1,colors))){\n            \/\/ \u8fd9\u91cc\u7684\u6216\u8fd0\u7b97||\u4ee3\u8868\u7740\uff0c\u5982\u679c\u6211\u4eec\u5176\u4e2d\u6709\u4e00\u4e2a\u70b9\u4e0d\u6ee1\u8db3\u5c31\u4e0d\u6210\u7acb\uff0c\u5fc5\u987b\u90fd\u6ee1\u8db3\u624d\u6210\u7acb\n            return true;\n        }\n    }\n    return false;\n}\nint main(){\n    \n    while(cin >> n){\n        if(!n) break;\n        memset(mx,0,sizeof(mx));\n        memset(color,0,sizeof(color));\n        string s;\n        int flag = 0; \/\/ flag\u4e3a0\u8bf4\u660e\u6ca1\u6709\u4efb\u4f55\u90bb\u5c45\u70b9\n        for(int i = 1;i <= n;i++){\n            cin >> s;\n            int u = s[0] - 'A' + 1;\n            for(int j = 2;j < s.size();j++){\n                flag = 1; \/\/ \u8bf4\u660e\u5b58\u5728\u90bb\u5c45\u70b9\n                int v = s[j] - 'A' + 1;\n                mx[u][v] = mx[v][u] = 1;\n            }\n        }\n        if(!flag){\n            cout << \"1 channel needed.\\n\";\n        }else if(dfs(1,2)){\n            cout << \"2 channels needed.\\n\";\n        }else if(dfs(1,3)){\n            cout << \"3 channels needed.\\n\";\n        }else{\n            cout << \"4 channels needed.\\n\";\n        }\n    }\n}<\/code><\/pre>\n\n\n\n
E004 \u79fb\u52a8\u7684\u9a91\u58eb<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4f60\u7684\u4e00\u4e2a\u670b\u53cb\u6b63\u5728\u7814\u7a76\u9a91\u58eb\u65c5\u884c\u95ee\u9898\uff08TKP\uff09\u3002\u5728\u4e00\u4e2a\u6709n\u4e2a\u65b9\u683c\u7684\u68cb\u76d8\u4e0a\uff0c\u4f60\u5f97\u627e\u5230\u4e00\u6761\u6700\u77ed\u7684\u5c01\u95ed\u9a91\u58eb\u65c5\u884c\u7684\u8def\u5f84\uff0c\u4f7f\u80fd\u591f\u904d\u5386\u6bcf\u4e2a\u65b9\u683c\u4e00\u6b21\u3002\u4ed6\u8ba4\u4e3a\u95ee\u9898\u7684\u6700\u56f0\u96be\u90e8\u5206\u5728\u4e8e\uff0c\u5bf9\u4e24\u4e2a\u7ed9\u5b9a\u7684\u65b9\u683c\uff0c\u786e\u5b9a\u9a91\u58eb\u79fb\u52a8\u6240\u9700\u7684\u6700\u5c0f\u6b65\u6570\u3002\u6240\u4ee5\u4f60\u5e2e\u52a9\u4ed6\u7f16\u5199\u4e00\u4e2a\u7a0b\u5e8f\uff0c\u89e3\u51b3\u8fd9\u4e2a\u201c\u56f0\u96be\u7684\u201d\u90e8\u5206\u3002\u4f60\u7684\u4efb\u52a1\u662f\uff1a\u8f93\u5165\u6709\u4e24\u4e2a\u65b9\u683ca\u548cb\uff0c\u786e\u5b9a\u9a91\u58eb\u5728\u6700\u77ed\u8def\u5f84\u4e0a\u4ecea\u5230b\u79fb\u52a8\u7684\u6b21\u6570\u3002<\/p>\n\n\n\n
\u56fd\u9645\u8c61\u68cb\u4e2d\u7684\u9a91\u58eb\u5728\u68cb\u76d8\u4e0a\u53ef\u79fb\u52a8\u7684\u8303\u56f4\u5982\u4e0b\u56fe\uff1a<\/p>\n\n\n\n
\"E004.png\"\/<\/div><\/figure>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u542b\u4e00\u7ec4\u6216\u591a\u7ec4\u6d4b\u8bd5\u4f8b\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u4f8b\u4e00\u884c\uff0c\u662f\u4e24\u4e2a\u65b9\u683c\uff0c\u7528\u7a7a\u683c\u9694\u5f00\u3002\u68cb\u76d8\u4e0a\u7684\u4e00\u4e2a\u65b9\u683c\u7528\u4e00\u4e2a\u5b57\u7b26\u4e32\u8868\u793a\uff0c\u5b57\u6bcd\uff08a-h\uff09\u8868\u793a\u5217\uff0c\u6570\u5b57\uff081-8\uff09\u8868\u793a\u884c\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u4e2a\u6d4b\u8bd5\u4f8b\uff0c\u8f93\u51fa\u4e00\u884c\uff1a\u201cTo get from xx to yy takes n knight moves.\u201d\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
e2 e4
a1 b2
b2 c3
a1 h8
a1 h7
h8 a1
b1 c3
f6 f6<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
To get from e2 to e4 takes 2 knight moves.
To get from a1 to b2 takes 4 knight moves.
To get from b2 to c3 takes 2 knight moves.
To get from a1 to h8 takes 6 knight moves.
To get from a1 to h7 takes 5 knight moves.
To get from h8 to a1 takes 6 knight moves.
To get from b1 to c3 takes 1 knight moves.
To get from f6 to f6 takes 0 knight moves.<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u662f\uff0c\u6700\u641c\u7d22\u7684\u4e00\u9053\u9898\u4e86\uff0c\u7b26\u5408\u641c\u7d22\u7684\u672c\u610f\u3010\uff1f\u3011<\/p>\n\n\n\n
DFS\uff1a<\/p>\n\n\n\n
\u6211\u4eec\u8981\u627e\u5230\u4ecea\u70b9\u5230b\u70b9\u7684\u4e00\u6761\u8def\uff0c\u6216\u8005\u4e5f\u4e0d\u9700\u8981\u77e5\u9053\u8fd9\u6761\u8def\uff0c\u6211\u4eec\u53ea\u8981\u8bb0\u5f55\u4ecea\u70b9\u5230b\u70b9\u8981\u8d70\u51e0\u6b65\u5c31\u597d\u3002<\/p>\n\n\n\n
\u6211\u7684\u4e00\u4e2a\u57fa\u672c\u601d\u8def\u5c31\u662f\uff0c\u7c7b\u4f3c\u4e8e\u4e0a\u9762\u7684\u95ea\u907f\u6e56\u6cca\uff0c\u6211\u4eec\u5c31\u4ece\u8d77\u70b9a\u5f00\u59cb\uff0c\u5f80\u516b\u4e2a\u65b9\u5411\u53bb\u5bfb\u627e\uff0c\u770b\u770b\u80fd\u4e0d\u80fd\u9047\u5230\u6211\u4eec\u8981\u7684\u76ee\u7684\u5730b\u3002<\/p>\n\n\n\n
\u6240\u4ee5\u6211\u4eec\u5c31\u4f1a\u5199\u51fa\u4e0b\u9762\u7684\u4ee3\u7801\uff0c\u53bb\u8bb0\u5f55\u6211\u4eec\u8d70\u5230\u54ea\u91cc\u4e86\uff08x\u548cy\uff09\u548c\u6211\u4eec\u8d70\u4e86\u51e0\u6b65\uff08move\uff09<\/p>\n\n\n\n
void dfs(int x,int y,int move){\n    dfs(x - 1,y - 2,move + 1);\n    dfs(x - 1,y + 2,move + 1);\n    dfs(x + 1,y - 2,move + 1);\n    dfs(x + 1,y + 2,move + 1);\n    dfs(x + 2,y - 1,move + 1);\n    dfs(x - 2,y - 1,move + 1);\n    dfs(x + 2,y + 1,move + 1);\n    dfs(x - 2,y + 1,move + 1);\n}<\/code><\/pre>\n\n\n\n
\u4f46\u662f\u6211\u4eec\u8fd9\u4e2a\u9012\u5f52\u4ec0\u4e48\u65f6\u5019\u7ed3\u675f\uff1f\u6211\u4eec\u7684\u641c\u7d22\u8981\u6709\u7ed3\u675f\u6761\u4ef6\uff0c\u6bd4\u5982\u6211\u4eec\u8dd1\u51fa\u4e86\u8fd9\u4e2a8 * 8\u7684\u683c\u5b50\uff0c\u6240\u4ee5\u6211\u4eec\u7ee7\u7eed\u5b8c\u5584\uff1a<\/p>\n\n\n\n
void dfs(int x,int y,int move){\n    \/\/ \u975e\u6cd5\u60c5\u51b5\n    if(x <= 0 || y <= 0 || x > 8 || y > 8){\n        return ;\n    }\n    dfs(x - 1,y - 2,move + 1);\n    dfs(x - 1,y + 2,move + 1);\n    dfs(x + 1,y - 2,move + 1);\n    dfs(x + 1,y + 2,move + 1);\n    dfs(x + 2,y - 1,move + 1);\n    dfs(x - 2,y - 1,move + 1);\n    dfs(x + 2,y + 1,move + 1);\n    dfs(x - 2,y + 1,move + 1);\n}<\/code><\/pre>\n\n\n\n
\u90a3\u6211\u4eec\u4ec0\u4e48\u65f6\u5019\u53ef\u4ee5\u627e\u5230\u7b54\u6848\u5462\uff0c\u5c31\u662f\u5f53x\u548cy\u8d70\u5230b\u70b9\u7684\u65f6\u5019\u3002\u6211\u4eec\u53ef\u4ee5\u7528\u4e00\u4e2a\u53d8\u91cf\u53bb\u8bb0\u5f55\u6211\u4eec\u8981\u7684\u7b54\u6848\uff0c\u6240\u4ee5\u6211\u4eec\u53ef\u4ee5\u7528\u5168\u5c40\u53d8\u91cfans\u53bb\u83b7\u53d6\u3002<\/p>\n\n\n\n
int ans = INF; \/\/ \u6211\u8fd9\u8fb9\u5b9a\u4e49INF = 0x3f3f3f3f\uff0c\u5176\u5b9e\u5c31\u662f\u4e00\u4e2a\u8db3\u591f\u5927\u7684\u6570\u5b57\u800c\u5df2\nvoid dfs(int x,int y,int move){\n    \/\/ \u5230\u8fbe\u4e86\n    if(x == xx2 && y == yy2){\n        ans = min(ans,move);\n        return ;\n    }\n    \/\/ \u975e\u6cd5\u60c5\u51b5\n    if(x <= 0 || y <= 0 || x > 8 || y > 8){\n        return ;\n    }\n    dfs(x - 1,y - 2,move + 1);\n    dfs(x - 1,y + 2,move + 1);\n    dfs(x + 1,y - 2,move + 1);\n    dfs(x + 1,y + 2,move + 1);\n    dfs(x + 2,y - 1,move + 1);\n    dfs(x - 2,y - 1,move + 1);\n    dfs(x + 2,y + 1,move + 1);\n    dfs(x - 2,y + 1,move + 1);\n}<\/code><\/pre>\n\n\n\n
\u4f46\u662f\u8fd9\u4e2a\u7a0b\u5e8f\u6ca1\u529e\u6cd5\u771f\u7684\u8fd9\u4e48\u8d70\uff0c\u56e0\u4e3a\u5982\u679c\u60f3\u8981\u8d70\u5b8c\u6240\u6709\u60c5\u51b5\uff0c\u90a3\u6211\u4eec\u8ba1\u7b97\u673a\u5185\u5b58\u90fd\u7206\u70b8\u4e86\uff0c\u56e0\u4e3a\u4f60\u4f1a\u5728\u51e0\u4e2a\u70b9\u4e4b\u95f4\u6253\u8f6c\uff0c\u4e0d\u53ef\u80fd\u7ed3\u675f\u7684\uff0c\u6240\u4ee5\u7b14\u8005\u5728\u8fd9\u91cc\u9650\u5236\u4e86\u641c\u7d22\u7684\u6b65\u6570\uff08\u4e0d\u80fd\u8d85\u8fc77\u6b65\uff09\u5c31\u4f1a\u5f97\u5230\u4e0b\u65b9\u7684\u9519\u89e3\u3002\u3010\u9519\u89e3\u662f\u56e0\u4e3a\u8981\u662f\u6709\u7684\u7b54\u6848\u9700\u8981\u8d85\u8fc7\u4e03\u6b65\u624d\u80fd\u5f97\u5230\u7684\u8bdd\uff0c\u90a3\u6211\u4eec\u5c31\u80af\u5b9a\u9519\u4e86\u3002\u4f46\u662f\u56e0\u4e3aOJ\u6570\u636e\u6bd4\u8f83\u6c34\uff0c\u6240\u4ee5\u5c31\u901a\u8fc7\u5566~\u3011<\/p>\n\n\n\n
\u90a3\u6211\u4eec\u521a\u521a\u8fd9\u4e2a\u601d\u8def\u4e0d\u592a\u597d\u600e\u4e48\u529e\uff1f\u6211\u4eec\u5176\u5b9e\u53ef\u4ee5\u60f3\u529e\u6cd5\u8bb0\u5f55\u7ed3\u679c\u3002<\/p>\n\n\n\n
\u6211\u4eec\u53ef\u4ee5\u7528\u4e2amx\u6570\u7ec4\u8bb0\u5f55\u6bcf\u4e2a\u683c\u5b50\u5230\u8fbe\u65f6\u7684\u6b65\u6570\uff0c\u5e76\u4e14\u53d6\u66f4\u5c0f\u7684\u4e00\u4e2a\u3002<\/p>\n\n\n\n
\u8fd9\u6837\u5c31\u4e0d\u4f1a\u51fa\u73b0\u5728\u51e0\u4e2a\u70b9\u6253\u8f6c\u7684\u60c5\u51b5\u4e86\u3010\u8bfb\u8005\u81ea\u884c\u601d\u8003\u4e3a\u4ec0\u4e48\u3011<\/p>\n\n\n\n
if(move >= mx[x][y]) return ;\nmx[x][y] = move;<\/code><\/pre>\n\n\n\n
\u4ee5\u4e0a\u5c31\u662fDFS\u7248\u672c\u7684\u5b8c\u6574\u601d\u8def\u3002<\/p>\n\n\n\n
\u5982\u679c\u8bfb\u8005\u5b66\u4e60\u8fc7BFS\uff0c\u8fd9\u9053\u9898\u66f4\u52a0\u5bb9\u6613\uff0c\u56e0\u4e3a\u5176\u5b9e\u8fd9\u7c7b\u5bfb\u627e\u6700\u5c11\u6b65\u6570\u3001\u6700\u4f18\u89e3\u3001\u6700\u597d\u60c5\u51b5\u3001\u6700\u77ed\u8def\u5f84<\/strong>\u7684\u95ee\u9898\uff0c\u90fd\u5e94\u8be5\u7528BFS\u89e3\u51b3\u4f1a\u5bb9\u6613\uff0c\u8fd9\u662f\u5e7f\u641c\u7684\u4f18\u8d8a\u6027\u3002<\/p>\n\n\n\n
\u8bfb\u8005\u53ef\u4ee5\u81ea\u884c\u64b0\u5199BFS\u7248\u672c\u7684\u4ee3\u7801\uff0c\u8fd9\u91cc\u4e0d\u9610\u8ff0BFS\u7684\u601d\u8def\u3002\u4e0b\u65b9\u7b14\u8005\u7ed9\u51fa\u4e86\u4e00\u7248BFS\u7684\u5199\u6cd5\uff0c\u8bfb\u8005\u53ef\u4ee5\u53c2\u8003\u5b66\u4e60\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++ \u53ef\u4ee5\u901a\u8fc7\u4f46\u5176\u5b9e\u662f\u9519\u7684\u89e3\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint xx1,xx2,yy1,yy2;\nconst int INF = 0x3f3f3f3f;\nint ans = INF; \/\/ ans\u8bb0\u5f55\u79fb\u52a8\u4e86\u51e0\u6b65\n\/\/ move\u8868\u793a\u6b64\u65f6\u5df2\u7ecf\u79fb\u52a8\u4e86\u51e0\u6b65,x\u548cy\u8868\u793a\u79fb\u52a8\u5230\u4e86\u54ea\u91cc\nvoid dfs(int x,int y,int move){\n    if(move > 7) return ; \/\/ \u9519\u8bef\uff0c\u4f46\u6211\u4eec\u53ef\u4ee5\u5047\u8bbe\u6211\u4eec\u627e\u4e03\u6b21\uff0c\u627e\u4e0d\u5230\u5c31\u7b97\u4e86\n    \/\/ \u5230\u8fbe\u4e86\n    if(x == xx2 && y == yy2){\n        ans = min(ans,move);\n        return ;\n    }\n    \/\/ \u975e\u6cd5\u60c5\u51b5\n    if(x <= 0 || y <= 0 || x > 8 || y > 8){\n        return ;\n    }\n    dfs(x - 1,y - 2,move + 1);\n    dfs(x - 1,y + 2,move + 1);\n    dfs(x + 1,y - 2,move + 1);\n    dfs(x + 1,y + 2,move + 1);\n    dfs(x + 2,y - 1,move + 1);\n    dfs(x - 2,y - 1,move + 1);\n    dfs(x + 2,y + 1,move + 1);\n    dfs(x - 2,y + 1,move + 1);\n}\nint main(){\n    string a,b;\n    while(cin >> a >> b){\n        ans = INF;\n        \/\/ \u5148\u63d0\u53d6\u51faa\u70b9\u548cb\u70b9\n        xx1 = a[0] - 'a' + 1;\n        yy1 = a[1] - '0';\n        xx2 = b[0] - 'a' + 1;\n        yy2 = b[1] - '0';\n        dfs(xx1,yy1,0);\n        cout << \"To get from \" << a << \" to \" << b << \" takes \" << ans << \" knight moves.\" << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801C++ DFS\u7248\u672c\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint xx1,xx2,yy1,yy2;\nint mx[10][10];\n\/\/ move\u8868\u793a\u6b64\u65f6\u5df2\u7ecf\u79fb\u52a8\u4e86\u51e0\u6b65,x\u548cy\u8868\u793a\u79fb\u52a8\u5230\u4e86\u54ea\u91cc\nvoid dfs(int x,int y,int move){\n    \/\/ \u975e\u6cd5\u60c5\u51b5\n    if(x <= 0 || y <= 0 || x > 8 || y > 8){\n        return ;\n    }\n    if(move >= mx[x][y]) return ;\n    mx[x][y] = move;\n    dfs(x - 1,y - 2,move + 1);\n    dfs(x - 1,y + 2,move + 1);\n    dfs(x + 1,y - 2,move + 1);\n    dfs(x + 1,y + 2,move + 1);\n    dfs(x + 2,y - 1,move + 1);\n    dfs(x - 2,y - 1,move + 1);\n    dfs(x + 2,y + 1,move + 1);\n    dfs(x - 2,y + 1,move + 1);\n}\nint main(){\n    string a,b;\n    while(cin >> a >> b){\n        memset(mx,0x3f,sizeof(mx));\n        \/\/ \u5148\u63d0\u53d6\u51faa\u70b9\u548cb\u70b9\n        xx1 = a[0] - 'a' + 1;\n        yy1 = a[1] - '0';\n        xx2 = b[0] - 'a' + 1;\n        yy2 = b[1] - '0';\n        dfs(xx1,yy1,0);\n        cout << \"To get from \" << a << \" to \" << b << \" takes \" << mx[xx2][yy2] << \" knight moves.\" << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801C++ BFS\u7248\u672c\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\n\nint xx1,xx2,yy1,yy2;\nint mx[10][10]; \/\/ \u5b58\u50a8\u6bcf\u4e2a\u4f4d\u7f6e\u7684\u6700\u5c0f\u6b65\u6570\nint dx[] = {-1, -1, 1, 1, 2, -2, 2, -2}; \/\/ \u6a2a\u5411\u79fb\u52a8\nint dy[] = {-2, 2, -2, 2, -1, -1, 1, 1}; \/\/ \u7eb5\u5411\u79fb\u52a8\n\n\/\/ \u5e7f\u5ea6\u4f18\u5148\u641c\u7d22\u51fd\u6570\nvoid bfs(int x, int y) {\n    queue<pair<int, int>> q; \/\/ \u961f\u5217\uff0c\u7528pair\u53ef\u4ee5\u5b58\u50a8\u5750\u6807\n    q.push({x, y});\n    mx[x][y] = 0; \/\/ \u8d77\u59cb\u4f4d\u7f6e\u7684\u6b65\u6570\u4e3a0\n\n    while (!q.empty()) {\n        pair<int, int> curr = q.front();\n        q.pop();\n        int cx = curr.first, cy = curr.second;\n        int move = mx[cx][cy];\n        \/\/ \u904d\u53868\u4e2a\u65b9\u5411\n        for (int i = 0; i < 8; i++) {\n            int nx = cx + dx[i], ny = cy + dy[i];\n            \/\/ \u68c0\u67e5\u65b0\u4f4d\u7f6e\u662f\u5426\u5408\u6cd5\u5e76\u4e14\u672a\u8bbf\u95ee\u8fc7\n            if (nx > 0 && nx <= 8 && ny > 0 && ny <= 8 && move + 1 < mx[nx][ny]) {\n                mx[nx][ny] = move + 1;\n                q.push({nx, ny});\n            }\n        }\n    }\n}\n\nint main() {\n    string a,b;\n    while (cin >> a >> b) {\n        memset(mx, 0x3f, sizeof(mx));\n        xx1 = a[0] - 'a' + 1;\n        yy1 = a[1] - '0';\n        xx2 = b[0] - 'a' + 1;\n        yy2 = b[1] - '0';\n        \/\/ \u4ece\u8d77\u59cb\u70b9\u5f00\u59cb\u5e7f\u5ea6\u4f18\u5148\u641c\u7d22\n        bfs(xx1, yy1);\n\n        cout << \"To get from \" << a << \" to \" << b << \" takes \" << mx[xx2][yy2] << \" knight moves.\" << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
E005 \u56fe\u50cf\u5468\u957f<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u75c5\u7406\u5b66\u5b9e\u9a8c\u5ba4\u7684\u6280\u672f\u4eba\u5458\u9700\u8981\u5206\u6790\u5e7b\u706f\u7247\u7684\u6570\u5b57\u56fe\u50cf\u3002\u5e7b\u706f\u7247\u4e0a\u6709\u8bb8\u591a\u8981\u5206\u6790\u7684\u76ee\u6807\uff0c\u7531\u9f20\u6807\u5355\u51fb\u786e\u5b9a\u4e00\u4e2a\u76ee\u6807\u3002\u76ee\u6807\u8fb9\u754c\u7684\u5468\u957f\u662f\u4e00\u4e2a\u6709\u7528\u7684\u6d4b\u91cf\u53c2\u6570\u3002\u7f16\u7a0b\u4efb\u52a1\uff1a\u786e\u5b9a\u9009\u4e2d\u76ee\u6807\u7684\u5728\u5468\u957f\u3002 \u6570\u5b57\u5316\u7684\u5e7b\u706f\u7247\u662f\u4e00\u4e2a\u77e9\u5f62\u7684\u7f51\u683c\uff0c\u91cc\u9762\u6709\u70b9\u2019.\u2019\uff0c\u8868\u793a\u7a7a\u7684\u5730\u65b9\uff1b\u6709\u5927\u5199\u5b57\u6bcd\u2018X\u2019\uff0c\u8868\u793a\u76ee\u6807\u7684\u4e00\u90e8\u5206\u3002\u7b80\u5355\u7f51\u683c\u5982\u4e0b\u6240\u793a<\/p>\n\n\n\n
\"E0051.png\"\/<\/div><\/figure>\n\n\n\n
\u65b9\u683c\u4e2d\u7684\u4e00\u4e2aX\u662f\u6307\u4e00\u4e2a\u5b8c\u6574\u7684\u7f51\u7edc\u65b9\u5f62\u533a\u57df\uff0c\u5305\u62ec\u5176\u8fb9\u754c\u548c\u76ee\u6807\u672c\u8eab\u3002\u7f51\u683c\u4e2d\u5fc3\u7684X\u4e0e\u5176\u8fb9\u754c\u4e0a8\u4e2a\u65b9\u5411\u7684X\u90fd\u662f\u76f8\u90bb\u7684\u3002\u4efb\u4f55\u4e24\u4e2a\u76f8\u90bb\u7684X\uff0c\u5176\u7f51\u683c\u65b9\u5f62\u533a\u57df\u5728\u8fb9\u754c\u6216\u8005\u62d0\u89d2\u5904\u662f\u91cd\u53e0\u7684\uff0c\u6240\u4ee5\u4ed6\u4eec\u7684\u7f51\u683c\u65b9\u5f62\u533a\u57df\u662f\u76f8\u90bb\u7684\u3002 \u4e00\u4e2a\u76ee\u6807\u662f\u7531\u4e00\u7cfb\u5217\u76f8\u90bbX\u7684\u7f51\u683c\u65b9\u5f62\u533a\u57df\u8fde\u63a5\u8d77\u6765\u6784\u6210\u7684\u3002\u5728\u7f51\u683c1\u4e2d\uff0c\u4e00\u4e2a\u76ee\u6807\u586b\u5145\u4e86\u5168\u90e8\u7f51\u683c\uff1b\u5728\u7f51\u683c2\u4e2d\u6709\u4e24\u4e2a\u76ee\u6807\uff0c\u5176\u4e2d\u4e00\u4e2a\u76ee\u6807\u53ea\u5360\u5de6\u4e0b\u89d2\u7684\u4e00\u4e2a\u7f51\u683c\u65b9\u5f62\u533a\u57df\uff0c\u5176\u4f59\u7684X\u5c5e\u4e8e\u53e6\u4e00\u4e2a\u76ee\u6807\u3002 \u6280\u672f\u4eba\u5458\u603b\u662f\u80fd\u5355\u51fb\u5230\u4e00\u4e2aX\uff0c\u4ee5\u9009\u4e2d\u5305\u542b\u8be5X\u7684\u76ee\u6807\uff0c\u8bb0\u5f55\u5355\u51fb\u65f6\u7684\u5750\u6807\u3002\u884c\u5217\u53f7\u662f\u4ece\u5de6\u4e0a\u89d2\u5f00\u59cb\uff0c\u4ece1\u5f00\u59cb\u7f16\u53f7\u7684\u3002\u5728\u7f51\u683c1\u4e2d\uff0c\u6280\u672f\u4eba\u5458\u53ef\u4ee5\u5355\u51fb\u884c2\u548c\u52172\u9009\u62e9\u76ee\u6807\uff1b\u5728\u7f51\u683c2\u4e2d\uff0c\u5355\u51fb\u884c2\u548c\u52173\u5c31\u53ef\u4ee5\u9009\u4e2d\u8f83\u5927\u76ee\u6807\uff0c\u5355\u51fb\u884c4\u548c\u52173\u5c31\u4e0d\u80fd\u9009\u4e2d\u4efb\u4f55\u76ee\u6807\u3002 \u4e00\u4e2a\u6709\u7528\u7684\u7edf\u8ba1\u53c2\u6570\u662f\u76ee\u6807\u7684\u5468\u957f\u3002\u5047\u5b9a\u6bcf\u4e2aX\u7684\u6bcf\u6761\u8fb9\u4e0a\u6709\u4e00\u4e2a\u65b9\u5f62\u7684\u5355\u5143\u3002\u5728\u7f51\u683c1\u4e2d\u76ee\u6807\u7684\u5468\u957f\u662f8\uff084\u4e2a\u8fb9\uff0c\u6bcf\u4e2a\u8fb9\u4e0a\u67092\u4e2a\u65b9\u5f62\u7684\u5355\u5143\uff09\uff1b\u5728\u7f51\u683c2\u4e2d\uff0c\u8f83\u5927\u76ee\u6807\u7684\u5468\u957f\u662f18\uff0c\u5982\u4e0b\u56fe\u6240\u793a\u3002<\/p>\n\n\n\n
\"E0052.png\"\/<\/div><\/figure>\n\n\n\n
\u76ee\u6807\u4e2d\u4e0d\u4f1a\u5305\u542b\u4efb\u4f55\u5b8c\u5168\u5c01\u95ed\u7684\u5b54\uff0c\u6240\u4ee5\u4e0b\u9762\u6700\u5de6\u8fb9\u7684\u7f51\u683c\u4e0d\u4f1a\u51fa\u73b0\uff0c\u5e94\u8be5\u662f\u53f3\u8fb9\u7684\u7f51\u683c\u6837\u5f0f\u3002<\/p>\n\n\n\n
\"E0053.png\"\/<\/div><\/figure>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6709\u591a\u7ec4\u7f51\u683c\u3002\u5bf9\u6bcf\u4e2a\u7f51\u683c\uff0c\u7b2c\u4e00\u884c\u662f\u7f51\u683c\u7684\u884c\u5217\u6570\uff08rows\uff0ccolumns\uff09\uff0c\u9f20\u6807\u5355\u51fb\u7684\u884c\u5217\u53f7\uff08row\uff0ccolumn\uff09\uff0c\u5176\u6574\u6570\u8303\u56f4\u90fd\u662f1-20.\u63a5\u4e0b\u6765\u5c31\u662frows\u884c\uff0c\u7531\u5b57\u7b26\u2018.\u2019\u548c\u2018X\u2019\u6784\u6210\u3002 \u5f53\u4e00\u884c\u662f4\u4e2a0\u65f6\uff0c\u6807\u5fd7\u8f93\u5165\u7ed3\u675f\u3002\u4e00\u884c\u4e2d\u76844\u4e2a\u6570\u5b57\u4e4b\u95f4\u5404\u6709\u4e00\u4e2a\u7a7a\u683c\u3002\u7f51\u683c\u6570\u636e\u7684\u884c\u4e4b\u95f4\u6ca1\u6709\u7a7a\u884c\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u4e2a\u7f51\u7edc\u8f93\u51fa\u4e00\u884c\uff0c\u662f\u9009\u4e2d\u76ee\u6807\u7684\u5468\u957f\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
2 2 2 2
XX
XX
6 4 2 3
.XXX
.XXX
.XXX
...X
..X.
X...
5 6 1 3
.XXXX.
X....X
..XX.X
.X...X
..XXX.
0 0 0 0<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
8
18
40<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u662f\u8fd9\u6837\u7684\u3002<\/p>\n\n\n\n
\u9996\u5148\u7ed9\u4e86\u4e2a\u8d77\u70b9\uff0c\u6240\u4ee5\u4f60\u53ef\u4ee5\u4e0a\u4e0b\u5de6\u53f3\u659c\u89d2\uff08\u603b\u51718\u4e2a\u65b9\u5411\uff09\u53bb\u641c\u7d22\uff0c\u6240\u4ee5\u8fd9\u4e2a\u662f\u5bb9\u6613\u7684\u3002<\/p>\n\n\n\n
\u4f46\u662f\u8981\u5982\u4f55\u5904\u7406\u5916\u56f4\u8fb9\u754c\u7684\u4e00\u5708\uff0c\u8fd9\u786e\u5b9e\u662f\u4e2a\u95ee\u9898\u3002<\/p>\n\n\n\n
\u8fd9\u9053\u9898\u505a\u6cd5\u5f88\u591a\uff0c\u7b14\u8005\u8fd9\u91cc\u7528\u7684\u662f\u4e00\u79cd\u76f8\u8f83\u7b80\u5355\u7684\u505a\u6cd5\u3002\u6211\u4eec\u9996\u5148\u5c06\u8fd9\u4e2a\u56fe\u5f62\u7684\u5468\u56f4\u4e00\u5708\u7528 . \u8986\u76d6\uff0c\u8fd9\u6837\u5c31\u4e0d\u4f1a\u51fa\u73b0\u7279\u5224\u7684\u60c5\u51b5\u3002<\/p>\n\n\n\n
\u7136\u540e\u6211\u4eec\u5c31\u6b63\u5e38DFS\u4ece\u8d77\u70b9\u5f00\u59cb\uff0c\u5f80\u516b\u4e2a\u65b9\u5411\u53bb\u641c\u7d22\uff0c\u5e76\u4e14\u641c\u7d22\u5230\u7684\u70b9\u90fd\u8981\u88ab\u6807\u8bb0\u3002<\/p>\n\n\n\n
\u6240\u4ee5\u8fd9\u6837\uff0c\u6211\u4eec\u5c31\u76f8\u5f53\u4e8e\u4ece\u56fe\u4e0a\uff0c\u628a\u8fd9\u4e00\u4e2a\u201c\u76ee\u6807\u201d\u7ed9\u201c\u63d0\u53d6\u201d\u51fa\u6765\u4e86\u3002<\/p>\n\n\n\n
\u5728\u8fd9\u4e2a\u8fc7\u7a0b\u4e2d\uff0c\u6211\u4eec\u628a\u6240\u6709\u9047\u5230\u7684 . \u90fd\u7b97\u8fdb\u957f\u5ea6\u91cc\uff0c\u9047\u5230\u4e00\u4e2a\u7b97\u4e00\u4e2a\u3002\u6700\u540e\u8fd9\u4e2a\u5468\u957f\u5c31\u7b97\u51fa\u6765\u4e86\u3002<\/p>\n\n\n\n
\u7528\u4e00\u53e5\u8bdd\u603b\u7ed3\u5c31\u662f\uff1a\u4ece\u8d77\u70b9\u5f00\u59cb\uff0c\u6211\u4eec\u5728X\u91cc\u641c\u7d22\uff0c\u9047\u5230\u7684\u6240\u6709 . \u90fd\u662f\u957f\u5ea6\u7684\u4e00\u90e8\u5206\u3010\u56e0\u4e3a\u5468\u957f\u4e00\u5b9a\u662f\u4e0e . \u76f8\u90bb\u7684\u90e8\u5206\u3011\u3002<\/p>\n\n\n\n
\u5f53\u7136\u8fd9\u9053\u9898\u8fd8\u6709\u5f88\u591a\u505a\u6cd5\uff0c\u5305\u62ecBFS\u4ec0\u4e48\u7684\uff0c\u6b22\u8fce\u8bfb\u8005\u81ea\u884c\u5c1d\u8bd5\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++ DFS\u7248\u672c\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nchar mx[100][100];\nint len = 0;\nint step_8[8][2] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}}; \/\/ \u5468\u56f4\u4e00\u5708\nint step_4[4][2] = {{-1,0},{1,0},{0,1},{0,-1}}; \/\/ \u5de6\u53f3\u4e0a\u4e0b\n\nvoid dfs(int x,int y){\n    \/\/ \u6807\u8bb0\u4e3a\u8bbf\u95ee\u8fc7\u4e86\n    if(mx[x][y] == 'X') mx[x][y] = ' ';\n    \n    \/\/ \u628a\u6574\u4e2a\u76ee\u6807\u91cc\u7684X\u90fd\u904d\u5386\n    for(int i = 0;i < 8;i++){\n        int nx = x + step_8[i][0];\n        int ny = y + step_8[i][1];\n        if(mx[nx][ny] == 'X') dfs(nx,ny);\n    }\n    \n    \/\/ \u770b\u770b\u8fd9\u4e00\u56e2\u76ee\u6807\uff0c\u80fd\u641c\u5230\u591a\u5c11\u4e2a.\u5728\u56db\u5468\n    for(int i = 0;i < 4;i++){\n        int nx = x + step_4[i][0];\n        int ny = y + step_4[i][1];\n        if(mx[nx][ny] == '.') len++;\n    }\n    \n}\n\nint main(){\n    int rows,cols,xx,yy;\n    while(cin >> rows >> cols >> xx >> yy){\n        if(!rows && !cols && !xx && !yy) break;\n        len = 0;\n        \n        \/\/ \u5148\u628a\u5468\u56f4\u4e00\u5708\u5305\u8d77\u6765\n        for(int i = 0;i <= cols + 1;i++){\n            mx[0][i] = '.';\n            mx[rows + 1][i] = '.';\n        }\n        for(int i = 0;i <= rows + 1;i++){\n            mx[i][0] = '.';\n            mx[i][cols + 1] = '.';\n        }\n        \n        for(int i = 1;i <= rows;i++){\n            for(int j = 1;j <= cols;j++){\n                cin >> mx[i][j];\n            }\n        }\n        dfs(xx,yy);\n        cout << len << \"\\n\";\n    }\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u524d\u8a00 \u8fd9\u4e00\u7ae0\u662f\u641c\u7d22\u76f8\u5173\uff0c\u641c\u7d22\u9700\u8981\u6709\u5f88\u5f3a\u7684\u201c\u8f6c\u79fb\u201d\u7684\u610f\u8bc6\uff0c\u4f60\u8981\u80fd\u628a\u9898\u76ee\u53d8\u6210\u4e00\u9897\u201c\u6811\u201d\uff0c\u7136\u540e\u5728\u8fd9\u68f5\u201d\u6811\u201c\u4e0a\u5b8c\u6210\u4f60\u7684 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,7],"tags":[],"class_list":["post-396","post","type-post","status-publish","format-standard","hentry","category-nenuoj-2","category-7"],"_links":{"self":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/396","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/comments?post=396"}],"version-history":[{"count":8,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/396\/revisions"}],"predecessor-version":[{"id":407,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/396\/revisions\/407"}],"wp:attachment":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/media?parent=396"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/categories?post=396"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/tags?post=396"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}