{"id":319,"date":"2024-08-28T17:15:16","date_gmt":"2024-08-28T09:15:16","guid":{"rendered":"https:\/\/www.nenuacm.top\/?p=319"},"modified":"2024-11-07T01:46:37","modified_gmt":"2024-11-06T17:46:37","slug":"nenuoj-%e4%b9%8b-%e7%ae%97%e6%b3%952%e5%8a%a8%e6%80%81%e8%a7%84%e5%88%92d","status":"publish","type":"post","link":"https:\/\/www.nenuacm.top\/index.php\/2024\/08\/28\/nenuoj-%e4%b9%8b-%e7%ae%97%e6%b3%952%e5%8a%a8%e6%80%81%e8%a7%84%e5%88%92d\/","title":{"rendered":"NENUOJ \u4e4b \u7b97\u6cd52\u52a8\u6001\u89c4\u5212D"},"content":{"rendered":"\n

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

\u8fd9\u4e00\u7ae0\u662f\u52a8\u6001\u89c4\u5212\uff0c\u7406\u89e3\u4e0a\u53ef\u80fd\u4f1a\u6bd4\u8f83\u6666\u6da9\uff0c\u4f46\u662f\u8fd8\u662f\u5e0c\u671b\u8bfb\u8005\u80fd\u5c3d\u91cf\u53bb\u7406\u89e3\u5176\u4e2d\u7684\u7cbe\u534e\u3002<\/p>\n<\/blockquote>\n\n\n\n

D001 \u6570\u5b57\u4e09\u89d2\u5f62<\/a><\/h2>\n\n\n\n
\n

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

7 3 8 8 1 0 2 7 4 4 4 5 2 6 5<\/p>\n\n\n\n

\u4e0a\u56fe\u7ed9\u51fa\u4e86\u4e00\u4e2a\u6570\u5b57\u4e09\u89d2\u5f62\u3002\u4ece\u4e09\u89d2\u5f62\u7684\u9876\u90e8\u5230\u5e95\u90e8\u6709\u5f88\u591a\u6761\u4e0d\u540c\u7684\u8def\u5f84\u3002\u5bf9\u4e8e\u6bcf\u6761\u8def\u5f84\uff0c\u628a\u8def\u5f84\u4e0a\u9762\u7684\u6570\u52a0\u8d77\u6765\u53ef\u4ee5\u5f97\u5230\u4e00\u4e2a\u548c\uff0c\u4f60\u7684\u4efb\u52a1\u5c31\u662f\u627e\u5230\u6700\u5927\u7684\u548c\u3002<\/p>\n\n\n\n

\u6ce8\u610f\uff1a\u8def\u5f84\u4e0a\u7684\u6bcf\u4e00\u6b65\u53ea\u80fd\u4ece\u4e00\u4e2a\u6570\u8d70\u5230\u4e0b\u4e00\u5c42\u4e0a\u548c\u5b83\u6700\u8fd1\u7684\u5de6\u8fb9\u7684\u90a3\u4e2a\u6570\u6216\u8005\u53f3\u8fb9\u7684\u90a3\u4e2a\u6570\u3002<\/p>\n\n\n\n

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

\u8f93\u5165\u7684\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u6574\u6570N (1 < N <= 100)\uff0c\u7ed9\u51fa\u4e09\u89d2\u5f62\u7684\u884c\u6570\u3002\u4e0b\u9762\u7684N\u884c\u7ed9\u51fa\u6570\u5b57\u4e09\u89d2\u5f62\u3002\u6570\u5b57\u4e09\u89d2\u5f62\u4e0a\u7684\u6570\u7684\u8303\u56f4\u90fd\u57280\u548c100\u4e4b\u95f4\u3002<\/p>\n\n\n\n

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

\u8f93\u51fa\u6700\u5927\u7684\u548c\u3002<\/p>\n\n\n\n

\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
5
7
3 8
8 1 0 
2 7 4 4
4 5 2 6 5<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
30<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u52a8\u6001\u89c4\u5212\uff08DP\uff09\u662f\u5206\u9636\u6bb5\u89e3\u51b3\u95ee\u9898\u7684\u65b9\u6cd5\uff0c\u9002\u7528\u4e8e\u9700\u8981\u6839\u636e\u5b50\u95ee\u9898\u7684\u89e3\u6765\u6784\u9020\u6574\u4e2a\u95ee\u9898\u89e3\u7684\u60c5\u51b5\u3002<\/p>\n\n\n\n
\u8fd9\u9053\u9898\u7684\u601d\u8def\u5c31\u662f\u6574\u4e2a\u8bfb\u5165\u4e4b\u540e\uff0c\u7136\u540e\u4ece\u4e0a\u5f80\u4e0b\u9012\u63a8\u3010\u4ece\u4e0b\u5f80\u4e0a\u4e5f\u4e0d\u662f\u4e0d\u884c\u3011\uff0c\u7136\u540e\u5904\u7406\u4e00\u4e0b\u8fb9\u754c\u5c31\u884c\u3002<\/p>\n\n\n\n
\u6211\u4eec\u4ece\u4e09\u89d2\u5f62\u7684\u9876\u90e8\u5f00\u59cb\uff0c\u9010\u6b65\u5411\u4e0b\u8ba1\u7b97\u6bcf\u4e2a\u4f4d\u7f6e\u53ef\u4ee5\u5f97\u5230\u7684\u6700\u5927\u548c<\/strong>\u3002<\/p>\n\n\n\n
$dp[i][j]$\u8868\u793a\u4ece\u9876\u90e8\u5230\u8fbe\u4f4d\u7f6e $(i, j)$ \u7684\u6700\u5927\u548c\u3002<\/p>\n\n\n\n
\u6211\u4eec\u9012\u63a8\u516c\u5f0f\u5c31\u662f$dp[i][j] = max(dp[i – 1][j – 1],dp[i – 1][j]) + a[i][j]$,\u4ece\u4e0a\u4e00\u5c42\u7684\u4e24\u4e2a\u53ef\u80fd\u4f4d\u7f6e\u9009\u62e9\u6700\u5927\u503c\uff0c\u5e76\u52a0\u4e0a\u5f53\u524d\u503c\u3002\u3010\u7136\u540e\u6700\u597d\u5904\u7406\u4e00\u4e0b\u8fb9\u754c\u503c\uff0c\u867d\u7136\u4e0d\u5904\u7406\u5e94\u8be5\u4e5f\u6ca1\u4e8b\u3011<\/p>\n\n\n\n
\u5176\u5b9e\u8fd9\u79cd\u4e09\u89d2\u5f62\u7684\u9898\u76ee\uff0c\u6211\u4eec\u6700\u597d\u91c7\u7528\u81ea\u4e0b\u800c\u4e0a\u7684\u529e\u6cd5\uff0c\u5373\u4e0b\u65b9\u7b2c\u4e8c\u90e8\u5206\u7684\u4ee3\u7801\uff0c\u516c\u5f0f\u662f$dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+a[i][j]$, $a[i][j]$\u662f\u5f53\u524d\u4f4d\u7f6e\u7684\u6570\u5b57\uff0c$dp[i+1][j]$ \u548c $dp[i+1][j+1]$ \u662f\u4e0b\u4e00\u884c\u7684\u4e24\u4e2a\u53ef\u80fd\u7684\u9009\u62e9\u3002\u6211\u4eec\u9009\u62e9\u5176\u4e2d\u8f83\u5927\u7684\u4e00\u4e2a\uff0c\u518d\u52a0\u4e0a\u5f53\u524d\u4f4d\u7f6e\u7684\u6570\u5b57\uff0c\u5373\u53ef\u5f97\u5230\u5f53\u524d\u4f4d\u7f6e\u7684\u6700\u5927\u548c\u3002<\/p>\n\n\n\n
\u5269\u4e0b\u8bfb\u8005\u81ea\u884c\u7406\u89e3~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++ \u81ea\u9876\u5411\u4e0b\u7248\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint a[1005][1005];\nint dp[1005][1005];\n\nint main(){\n    int n;\n    int maxx = -1;\n    while(cin >> n){\n        maxx = -1;\n        for(int i = 1;i <= n;i++){\n            for(int j = 1;j <= i;j++){\n                cin >> a[i][j]; \n                dp[i][j] = a[i][j];\n            }\n        }\n        for(int i = 1;i <= n;i++){\n            for(int j = 1;j <= i;j++){\n                if(i - 1 >= 1 && j - 1 >= 1)\n                    dp[i][j] = max(dp[i - 1][j - 1],dp[i - 1][j]) + a[i][j];\n                else if(j - 1 == 0)\n                    dp[i][j] = dp[i - 1][j] + a[i][j];\n                maxx = max(dp[i][j],maxx);\n            }\n        }\n        cout << maxx << \"\\n\";\n    }\n    \n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801C++ \u81ea\u5e95\u5411\u4e0a\u7248\u672c\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint a[1005][1005];\nint dp[1005][1005];\n\nint main(){\n    int n;\n    int maxx = -1;\n\n    while(cin >> n){\n        maxx = -1;\n        for(int i = 1;i <= n;i++){\n            for(int j = 1;j <= i;j++){\n                cin >> a[i][j]; \n                dp[i][j] = a[i][j];\n            }\n        }\n        \n        \/\/ \u4ece\u5012\u6570\u7b2c\u4e8c\u884c\u5f00\u59cb\uff0c\u8ba1\u7b97\u6bcf\u4e2a\u4f4d\u7f6e\u7684\u6700\u5927\u8def\u5f84\u548c\n        for(int i = n - 1;i >= 1;i--){\n            for(int j = 1;j <= i;j++){\n                dp[i][j] = max(dp[i+1][j], dp[i+1][j+1]) + a[i][j];\n                maxx = max(dp[i][j], maxx);\n            }\n        }\n\n        cout << maxx << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
D002 \u6700\u957f\u4e0a\u5347\u5b50\u5e8f\u5217<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4e00\u4e2a\u6570\u7684\u5e8f\u5217bi\uff0c\u5f53b1 < b2 < … < bS\u7684\u65f6\u5019\uff0c\u6211\u4eec\u79f0\u8fd9\u4e2a\u5e8f\u5217\u662f\u4e0a\u5347\u7684\u3002\u5bf9\u4e8e\u7ed9\u5b9a\u7684\u4e00\u4e2a\u5e8f\u5217(a1, a2, …, aN)\uff0c\u6211\u4eec\u53ef\u4ee5\u5f97\u5230\u4e00\u4e9b\u4e0a\u5347\u7684\u5b50\u5e8f\u5217(ai1, ai2, …, aiK)\uff0c\u8fd9\u91cc1 <= i1 < i2 < … <iK <= N\u3002\u6bd4\u5982\uff0c\u5bf9\u4e8e\u5e8f\u5217(1, 7, 3, 5, 9, 4, 8)\uff0c\u6709\u5b83\u7684\u4e00\u4e9b\u4e0a\u5347\u5b50\u5e8f\u5217\uff0c\u5982(1, 7), (3, 4, 8)\u7b49\u7b49\u3002\u8fd9\u4e9b\u5b50\u5e8f\u5217\u4e2d\u6700\u957f\u7684\u957f\u5ea6\u662f4\uff0c\u6bd4\u5982\u5b50\u5e8f\u5217(1, 3, 5, 8)\u3002<\/p>\n\n\n\n
\u4f60\u7684\u4efb\u52a1\uff0c\u5c31\u662f\u5bf9\u4e8e\u7ed9\u5b9a\u7684\u5e8f\u5217\uff0c\u6c42\u51fa\u6700\u957f\u4e0a\u5347\u5b50\u5e8f\u5217\u7684\u957f\u5ea6\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6709\u5f88\u591a\u7ec4\uff0c\u6bcf\u7ec4\u8f93\u5165\u7684\u7b2c\u4e00\u884c\u662f\u5e8f\u5217\u7684\u957f\u5ea6N (1 <= N <= 1000)\u3002\u7b2c\u4e8c\u884c\u7ed9\u51fa\u5e8f\u5217\u4e2d\u7684N\u4e2a\u6574\u6570\uff0c\u8fd9\u4e9b\u6574\u6570\u7684\u53d6\u503c\u8303\u56f4\u90fd\u57280\u523010000\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fa\u6bcf\u7ec4\u7684\u6700\u957f\u4e0a\u5347\u5b50\u5e8f\u5217\u7684\u957f\u5ea6\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
7
1 7 3 5 9 4 8
6
2 3 4 1 6 5<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
4
4<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u7ecf\u5178\u4e4b\u4e2d\u7684\u7ecf\u5178\u9898\uff0c\u5fc5\u4f1a\uff01<\/p>\n\n\n\n
\u5176\u5b9e\u5c31\u662f\u4e00\u79cd\u66b4\u529b\uff0c\u4f46\u662f\u53c8\u7528\u6570\u7ec4\u4fdd\u5b58\u4e86\u3010\u5230\u5f53\u524d\u7d22\u5f15\u6700\u957f\u7684\u4e0a\u5347\u957f\u5ea6\u3011\u8fd9\u4e2a\u4e8b\u60c5\u3002<\/p>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e2a\u5143\u7d20 a[i]\uff0c\u6211\u4eec\u67e5\u627e\u5176\u4e4b\u524d\u6240\u6709\u7684\u5143\u7d20$a[j]\uff08j < i\uff09$\uff0c\u5982\u679c$a[i] > a[j]$\uff0c\u5219\u8bf4\u660e\u53ef\u4ee5\u5c06 $a[i]$ \u52a0\u5230\u4ee5 $a[j]$ \u4e3a\u7ed3\u5c3e\u7684\u4e0a\u5347\u5b50\u5e8f\u5217\u4e2d\uff0c\u6b64\u65f6 $dp[i] = max(dp[i], dp[j] + 1)$ \uff0c\u5373\u957f\u5ea6 + 1\u3002<\/p>\n\n\n\n
\u6700\u540e\u6211\u4eec\u76f4\u63a5\u8f93\u51fa\u6700\u5927\u7684\u4e00\u4e2adp\u503c\u3010\u5373\u627e\u5230\u4e00\u4e2a\u6700\u957f\u7684\u7ed3\u5c3e\u503c\u3011\u3010\u4f46\u662fOJ\u4e0d\u52a0\u8fd9\u4e00\u6bb5\u90fd\u884c\uff0c\u6570\u636e\u592a\u5f31\u4e86\uff0c\u6240\u4ee5\u4f1a\u5bfc\u81f4\u4e00\u4e9b\u9519\u8bef\u4ee3\u7801\u901a\u8fc7\u3011<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint a[10000];\nint dp[1005];\nint main(){\n    int n;\n    while(cin >> n){\n        for(int i = 1;i <= n;i++){\n            cin >> a[i];\n            dp[i] = 1;\n        }\n        for(int i = 1;i <= n;i++){\n            for(int j = 1;j < i;j++){\n                if(a[i] > a[j]){\n                    dp[i] = max(dp[i],dp[j] + 1);\n                }\n            }\n        }\n        \/\/ \u8f93\u51fa\u6700\u5927\u7684\u4e00\u4e2adp\u503c\n        int maxx = -1;\n        for(int i = 1;i <= n;i++){\n            maxx = max(maxx,dp[i]);\n        }\n        cout << maxx << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
D003 Help Jimmy<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
“Help Jimmy” \u662f\u5728\u4e0b\u56fe\u6240\u793a\u7684\u573a\u666f\u4e0a\u5b8c\u6210\u7684\u6e38\u620f\uff1a \"D003.png\"<\/p>\n\n\n\n
\u573a\u666f\u4e2d\u5305\u62ec\u591a\u4e2a\u957f\u5ea6\u548c\u9ad8\u5ea6\u5404\u4e0d\u76f8\u540c\u7684\u5e73\u53f0\u3002\u5730\u9762\u662f\u6700\u4f4e\u7684\u5e73\u53f0\uff0c\u9ad8\u5ea6\u4e3a\u96f6\uff0c\u957f\u5ea6\u65e0\u9650\u3002 Jimmy\u8001\u9f20\u5728\u65f6\u523b0\u4ece\u9ad8\u4e8e\u6240\u6709\u5e73\u53f0\u7684\u67d0\u5904\u5f00\u59cb\u4e0b\u843d\uff0c\u5b83\u7684\u4e0b\u843d\u901f\u5ea6\u59cb\u7ec8\u4e3a1\u7c73\/\u79d2\u3002\u5f53Jimmy\u843d\u5230\u67d0\u4e2a\u5e73\u53f0\u4e0a\u65f6\uff0c\u6e38\u620f\u8005\u9009\u62e9\u8ba9\u5b83\u5411\u5de6\u8fd8\u662f\u5411\u53f3\u8dd1\uff0c\u5b83\u8dd1\u52a8\u7684\u901f\u5ea6\u4e5f\u662f1\u7c73\/\u79d2\u3002\u5f53Jimmy\u8dd1\u5230\u5e73\u53f0\u7684\u8fb9\u7f18\u65f6\uff0c\u5f00\u59cb\u7ee7\u7eed\u4e0b\u843d\u3002Jimmy\u6bcf\u6b21\u4e0b\u843d\u7684\u9ad8\u5ea6\u4e0d\u80fd\u8d85\u8fc7MAX\u7c73\uff0c\u4e0d\u7136\u5c31\u4f1a\u6454\u6b7b\uff0c\u6e38\u620f\u4e5f\u4f1a\u7ed3\u675f\u3002 \u8bbe\u8ba1\u4e00\u4e2a\u7a0b\u5e8f\uff0c\u8ba1\u7b97Jimmy\u5230\u5730\u9762\u65f6\u53ef\u80fd\u7684\u6700\u65e9\u65f6\u95f4\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c\u4e00\u884c\u662f\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570t\uff080 <= t <= 20\uff09\u3002\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u7684\u7b2c\u4e00\u884c\u662f\u56db\u4e2a\u6574\u6570N\uff0cX\uff0cY\uff0cMAX\uff0c\u7528\u7a7a\u683c\u5206\u9694\u3002N\u662f\u5e73\u53f0\u7684\u6570\u76ee\uff08\u4e0d\u5305\u62ec\u5730\u9762\uff09\uff0cX\u548cY\u662fJimmy\u5f00\u59cb\u4e0b\u843d\u7684\u4f4d\u7f6e\u7684\u6a2a\u7ad6\u5750\u6807\uff0cMAX\u662f\u4e00\u6b21\u4e0b\u843d\u7684\u6700\u5927\u9ad8\u5ea6\u3002\u63a5\u4e0b\u6765\u7684N\u884c\u6bcf\u884c\u63cf\u8ff0\u4e00\u4e2a\u5e73\u53f0\uff0c\u5305\u62ec\u4e09\u4e2a\u6574\u6570\uff0cX1[i]\uff0cX2[i]\u548cH[i]\u3002H[i]\u8868\u793a\u5e73\u53f0\u7684\u9ad8\u5ea6\uff0cX1[i]\u548cX2[i]\u8868\u793a\u5e73\u53f0\u5de6\u53f3\u7aef\u70b9\u7684\u6a2a\u5750\u6807\u30021<= N <= 1000\uff0c-20000 <= X, X1[i], X2[i] <= 20000\uff0c0 < H[i] < Y <= 20000\uff08i = 1..N\uff09\u3002\u6240\u6709\u5750\u6807\u7684\u5355\u4f4d\u90fd\u662f\u7c73\u3002 Jimmy \u7684\u5927\u5c0f\u548c\u5e73\u53f0\u7684\u539a\u5ea6\u5747\u5ffd\u7565\u4e0d\u8ba1\u3002\u5982\u679cJimmy \u6070\u597d\u843d\u5728\u67d0\u4e2a\u5e73\u53f0\u7684\u8fb9\u7f18\uff0c\u88ab\u89c6\u4e3a\u843d\u5728\u5e73\u53f0\u4e0a\u3002\u6240\u6709\u7684\u5e73\u53f0\u5747\u4e0d\u91cd\u53e0\u6216\u76f8\u8fde\u3002\u6d4b\u8bd5\u6570\u636e\u4fddJimmy\u4e00\u5b9a\u80fd\u5b89\u5168\u5230\u8fbe\u5730\u9762\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u7684\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u4e00\u4e2a\u6574\u6570\uff0cJimmy\u5230\u5730\u9762\u65f6\u53ef\u80fd\u7684\u6700\u65e9\u65f6\u95f4\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
1
3 8 17 20
0 10 8
0 10 13
4 14 3<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
23<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u6709\u70b9\u590d\u6742\uff0c\u5176\u5b9e\u662f\u8fd9\u6837\u5904\u7406\u7684\u3002\u6211\u4eec\u628a\u5730\u9762\u4e5f\u5f53\u4f5c\u4e00\u4e2a\u65e0\u9650\u5927\u7684\u5e73\u53f0\uff0c\u7136\u540e\u628a\u6240\u6709\u5e73\u53f0\u8fdb\u884c\u6392\u5e8f\u3002<\/p>\n\n\n\n
\u4e4b\u540e\u6211\u4eec\u5bf9\u5728\u5e73\u53f0\u4e0a\u5411\u5de6\u8fd8\u662f\u5411\u53f3\u7684\u60c5\u51b5\u8fdb\u884c\u5206\u7c7b\u8ba8\u8bba\uff0c\u7136\u540e\u518d\u5bf9\u80fd\u5426\u843d\u5230\u5e73\u53f0\u8fd9\u4ef6\u4e8b\u518d\u5206\u7c7b\u8ba8\u8bba\u3002<\/p>\n\n\n\n
\u6709\u70b9\u590d\u6742\uff0c\u76f4\u63a5\u770b\u4ee3\u7801\u5427\uff0c\u6211\u4eec\u7528\u4e8c\u7ef4dp\u6570\u7ec4\u8bb0\u5f55\u5411\u5de6\/\u5411\u53f3\u7684\u843d\u5730\u6700\u77ed\u65f6\u95f4\u3002<\/p>\n\n\n\n
\u8fd9\u9053\u9898\u6211\u4eec\u7528flat\u7ed3\u6784\u4f53\u8bb0\u5f55\u5de6\u7aef\u70b9\u3001\u53f3\u7aef\u70b9\u3001\u9ad8\u5ea6\uff0c\u7136\u540e\u6211\u4eec\u5c31\u53bb\u6a21\u62df\u4e00\u4e2a\u4eba\u5982\u679c\u5411\u5de6<\/strong>\u60f3\u8981\u5230\u4e0b\u4e00\u5757\u677f\u5b50\uff0c\u90a3\u5de6\u7aef\u70b9<\/strong>\u5c31\u5f97\u5728\u4e0b\u4e00\u5757\u677f\u5b50\u7684\u5de6\u53f3\u4e4b\u95f4\uff0c\u540c\u7406\uff0c\u5982\u679c\u4e00\u4e2a\u4eba\u60f3\u8981\u5411\u53f3<\/strong>\u5230\u8fbe\u4e0b\u4e00\u5757\u677f\u5b50\uff0c\u90a3\u53f3\u7aef\u70b9<\/strong>\u5c31\u5f97\u5728\u4e0b\u4e00\u5757\u677f\u5b50\u7684\u5de6\u53f3\u4e4b\u95f4\u3002<\/p>\n\n\n\n
\u6211\u4eec\u7684dp\u6570\u7ec4\u6709\u4e24\u7ef4\uff0c\u7b2c\u4e00\u7ef4\u8bb0\u5f55\u5411\u5de6\uff080\uff09\u8dd1\u6216\u8005\u5411\u53f3\uff081\uff09\u8dd1\uff0c\u7b2c\u4e8c\u7ef4\u8bb0\u5f55\u5728\u54ea\u4e00\u5757\u677f\u5b50\u4e0a\u3002<\/p>\n\n\n\n
\u65e2\u7136\u6211\u4eec\u6709\u7b2c\u4e00\u5757\u677f\u5b50\u3001\u7b2c\u4e8c\u5757\u677f\u5b50\u8fd9\u6837\u7684\u533a\u5206\uff0c\u6211\u4eec\u5c31\u80af\u5b9a\u9700\u8981\u628a\u8fd9\u4e9b\u677f\u5b50\u8fdb\u884c\u6392\u5e8f~<\/p>\n\n\n\n
\u7136\u540e\u6211\u4eec\u5199\u4e24\u4e2a\u51fd\u6570\uff0c\u5206\u522b\u5bf9\u5e94left\u548cright\u3002<\/p>\n\n\n\n
\u6211\u4eec\u5206\u6790\u4e00\u4e0bleft\uff08\u5411\u5de6\u7aef\u70b9\u8dd1\uff09\u7684\u60c5\u51b5\uff0c\u9996\u5148\u6211\u4eec\u7528while\u5faa\u73af\u53bb\u627e\uff08\u5411\u5de6\u7aef\u70b9\u8dd1\uff09\u80fd\u5230\u7684\u677f\u5b50\u3010\u4e0d\u662f\u4e0b\u4e00\u5757\u677f\u5b50i – 1\u5c31\u4e00\u5b9a\u662f\u54e6\u3011\uff0c\u6211\u4eec\u9700\u8981\u53bb\u5224\u65ad\uff1a\u6211\u4eec\u8981\u53bb\u7684\u4e0b\u4e00\u5757\u677f\u5b50\u662f\u5426\u80fd\u63a5\u4f4f\u3001\u6211\u4eec\u8981\u53bb\u7684\u4e0b\u4e00\u5757\u677f\u5b50\u662f\u5426\u9ad8\u5ea6\u4f1a\u8d85\u8fc7\u3002\u7b2c\u4e00\u4e2a\u6761\u4ef6\u597d\u5224\u65ad\uff0c\u6211\u4eec\u7528$a[temp].l <= a[i].l \\space\\&\\&\\space a[i].l <= a[temp].r$\u3010temp\u662f\u6211\u4eec\u6b63\u5728\u5224\u65ad\u80fd\u4e0d\u80fd\u53bb\u7684\u4e0b\u4e00\u5757\u677f\u5b50\u3011\u5373\u53ef\u5224\u65ad\uff0c\u7b2c\u4e8c\u4e2a\u6761\u4ef6\u4e5f\u5f88\u597d\u5224\u65ad\uff0c\u4f46\u662f\u6211\u4eec\u8fd8\u8981\u7528dp\u6570\u7ec4\u8bb0\u5f55\u65f6\u95f4\u3002<\/p>\n\n\n\n
\u4e0b\u964d\u65f6\u95f4\u5f88\u597d\u5224\u65ad\uff0c\u5373 $a[i].h – a[temp].h$ \uff0c\u4f46\u6211\u4eec\u4e5f\u8981\u7b97\u79fb\u52a8\u65f6\u95f4\uff0c\u6211\u4eec\u7528$min(dp[temp][0] + a[i].l-a[temp].l,dp[temp][1] + a[temp].r-a[i].l)$ \u8bb0\u5f55\uff0c$a[i].l – a[temp].l$ \u5373\u4e3a\u8981\u8dd1\u5230\u4e0b\u4e00\u4e2a\u677f\u5b50\u7684\u5de6\u7aef\u70b9\uff0c\u8fd8\u662f$a[temp].r-a[i].l$\u8dd1\u5230\u4e0b\u4e00\u4e2a\u677f\u5b50\u7684\u53f3\u7aef\u70b9\uff0c\u8fd9\u91cc\u51fa\u73b0\u7684dp\u5176\u5b9e\u6709\u70b9\u96be\u7406\u89e3\uff0c\u4f46\u662f\u56e0\u4e3a\u6211\u4eec\u5176\u5b9e\u6700\u540e\u5faa\u73af\u662f\u81ea\u4e0b\u800c\u4e0a\u63a8\u5bfc\u7684\uff0c\u6240\u4ee5\u6211\u4eec\u8fd9\u4e2a\u65f6\u5019dp\u8bb0\u5f55\u7684\u662f\u7b2ctemp\u677f\u5b50\u4e0e\u5730\u9762\u4e4b\u95f4\u7684\u65f6\u95f4\uff0c\u7136\u540e\u52a0\u4e0a\u521a\u521a\u6211\u4eec\u7b97\u7684\u8fd9\u4e24\u5757\u677f\u4e4b\u95f4\u7684\u65f6\u95f4\uff0c\u8fd9\u4e9b\u5171\u540c\u7ec4\u6210\u4e86\u6240\u6709\u7684\u65f6\u95f4\u3002<\/p>\n\n\n\n
\u6700\u540e\u6211\u4eec\u81ea\u5e95\u5411\u4e0a\u8fdb\u884c\u65f6\u95f4\u8ba1\u7b97\uff0c\u4f9d\u6b21\u8ba1\u7b97\u5047\u8bbe\u6211\u4eec\u4ece\u7b2c2\u5757\u677f\u5f00\u59cb\u4e0b\u964d\u3001\u7b2c3\u5757\u677f\u5f00\u59cb\u4e0b\u964d\u3001\u7b2c4\u5757\u677f\u5f00\u59cb\u4e0b\u964d\u2026\u7b2cn + 1\u5757\u677f\u5f00\u59cb\u4e0b\u964d\uff0c\u8f93\u51fa $min(dp[n+1][0],dp[n+1][1])$ \u5373\u4e3a\u6211\u4eec\u4ece\u7b2cn + 1\u5757\u677f\u5f00\u59cb\u4e0b\u964d\u7684\u6700\u77ed\u65f6\u95f4\u4e86\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXN = 2e5 + 5;\nint dp[2005][2];\nint n,x,y,maxx;\n\ntypedef struct flat{\n    int l = 0;\n    int r = 0;\n    int h = 0;\n}flat;\nflat a[1005];\nbool cmp(flat a,flat b){\n    return a.h < b.h;\n}\nvoid left(int i){\n    int temp = i - 1;\n    while(temp > 0 && a[i].h - a[temp].h <= maxx){\n        if(a[temp].l <= a[i].l && a[i].l <= a[temp].r){ \/\/ \u4e00\u5b9a\u4f1a\u843d\u5230\u677f\u5b50\u4e0a\n            dp[i][0] = (a[i].h - a[temp].h) + min(dp[temp][0] + a[i].l-a[temp].l,dp[temp][1] + a[temp].r-a[i].l);\n            return;\n        }\n        temp--;\n    }\n    if(a[i].h - a[temp].h > maxx){\n        dp[i][0] = MAXN;\n    }else{\n        dp[i][0] = a[i].h;\n    }\n}\nvoid right(int i){\n    int temp = i - 1;\n    while(temp > 0 && a[i].h - a[temp].h <= maxx){\n        if(a[temp].l <= a[i].r && a[i].r <= a[temp].r){ \/\/ \u4e00\u5b9a\u4f1a\u843d\u5230\u677f\u5b50\u4e0a\n            dp[i][1] = (a[i].h - a[temp].h) + min(dp[temp][0] + a[i].r-a[temp].l,dp[temp][1] + a[temp].r-a[i].r);\n            return;\n        }\n        temp--;\n    }\n    if(a[i].h - a[temp].h > maxx){\n        dp[i][1] = MAXN;\n    }else{\n        dp[i][1] = a[i].h;\n    }\n}\nvoid solve(){\n    cin >> n;\n    cin >> a[n + 1].l >> a[n + 1].h >> maxx;\n    for(int i = 1;i <= n;i++){\n        cin >> a[i].l >> a[i].r >> a[i].h;\n    }\n    \/\/\u8d77\u70b9\n    a[n + 1].r = a[n + 1].l;\n    \/\/\u5e73\u53f0\n    a[0].l = -MAXN;\n    a[0].r = MAXN;\n    a[0].h = 0;\n    \n    sort(a,a + n + 1,cmp);\n    for(int i = 1;i <= n + 1;++i){\n        left(i);\n        right(i);\n    }\n    cout << min(dp[n+1][0],dp[n+1][1]) << \"\\n\";\n}\nint main(){\n    int t;\n    cin >> t;\n    while(t--) solve();\n}<\/code><\/pre>\n\n\n\n
D004 \u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u6211\u4eec\u79f0\u5e8f\u5217Z = < z1, z2, …, zk >\u662f\u5e8f\u5217X = < x1, x2, …, xm >\u7684\u5b50\u5e8f\u5217\u5f53\u4e14\u4ec5\u5f53\u5b58\u5728\u4e25\u683c\u4e0a\u5347\u7684\u5e8f\u5217< i1, i2, …, ik >\uff0c\u4f7f\u5f97\u5bf9j = 1, 2, … ,k, \u6709xij = zj\u3002\u6bd4\u5982Z = < a, b, f, c > \u662fX = < a, b,c, f, b, c >\u7684\u5b50\u5e8f\u5217\u3002 \u73b0\u5728\u7ed9\u51fa\u4e24\u4e2a\u5e8f\u5217X\u548cY\uff0c\u4f60\u7684\u4efb\u52a1\u662f\u627e\u5230X\u548cY\u7684\u6700\u5927\u516c\u5171\u5b50\u5e8f\u5217\uff0c\u4e5f\u5c31\u662f\u8bf4\u8981\u627e\u5230\u4e00\u4e2a\u6700\u957f\u7684\u5e8f\u5217Z\uff0c\u4f7f\u5f97Z\u65e2\u662fX\u7684\u5b50\u5e8f\u5217\u4e5f\u662fY\u7684\u5b50\u5e8f\u5217\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u62ec\u591a\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002\u6bcf\u7ec4\u6570\u636e\u5305\u62ec\u4e00\u884c\uff0c\u7ed9\u51fa\u4e24\u4e2a\u957f\u5ea6\u4e0d\u8d85\u8fc7200\u7684\u5b57\u7b26\u4e32\uff0c\u8868\u793a\u4e24\u4e2a\u5e8f\u5217\u3002\u4e24\u4e2a\u5b57\u7b26\u4e32\u4e4b\u95f4\u7531\u82e5\u5e72\u4e2a\u7a7a\u683c\u9694\u5f00\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u7ec4\u8f93\u5165\u6570\u636e\uff0c\u8f93\u51fa\u4e00\u884c\uff0c\u7ed9\u51fa\u4e24\u4e2a\u5e8f\u5217\u7684\u6700\u5927\u516c\u5171\u5b50\u5e8f\u5217\u7684\u957f\u5ea6\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
abcfbc abfcab
programming contest
abcd mnp<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
4
2
0<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u4e5f\u662f\u7ecf\u5178\u9898\u76ee~<\/p>\n\n\n\n
\u5176\u5b9e\u5c31\u662f\u5206\u7c7b\u8ba8\u8bba+\u66b4\u529b\u53cc\u5faa\uff0c\u5982\u679c\u5f53\u524d\u70b9\u7b26\u5408\uff0c\u957f\u5ea6\u5c31\u662f\u3010\u4e4b\u524d\u72b6\u6001+1\u3011\uff0c\u5982\u679c\u4e0d\u7b26\u5408\uff0c\u5f53\u524d\u72b6\u6001\u5c31\u7b49\u4e8emax\uff08\u3010\u4e4b\u524d\u72b6\u6001\u3011\uff09\u3002<\/p>\n\n\n\n
\u9996\u5148\u641e\u6e05\u695a\u9898\u610f\uff0c\u4e5f\u5c31\u662f\u6211\u4eec\u8981\u5728\u4e24\u4e2a\u5b57\u7b26\u4e32\u4e2d\uff0c\u627e\u5230\u6700\u957f\u7684\u90a3\u4e2a\u516c\u5171\u7684\u5b50\u5e8f\u5217\u3002<\/p>\n\n\n\n
\u6211\u4eec\u7528\u4e8c\u7ef4dp\u6570\u7ec4\u8bb0\u5f55\u4e24\u4e2a\u4e8b\u60c5\uff0c\u4e00\u7ef4\u8bb0\u5f55\u5b57\u7b26\u4e321\uff0c\u4e8c\u7ef4\u8bb0\u5f55\u5b57\u7b26\u4e322\uff0c$dp[i][j]$ \u5373\u4e3a\uff0c\u5f53\u8ba1\u7b97\u5230\u5b57\u7b26\u4e321\u7684\u7b2ci\u4e2a\u548c\u5b57\u7b26\u4e322\u7684\u7b2cj\u4e2a\u7684\u4f4d\u7f6e\u65f6\uff0c\u6b64\u65f6\u627e\u5230\u7684\u6700\u957f\u7684\u516c\u5171\u5b50\u5e8f\u5217\u6709\u591a\u957f\u3002<\/p>\n\n\n\n
\u5982\u679c\u5b57\u7b26\u76f8\u7b49<\/strong>\uff08$a[i-1] == b[j-1]$\uff09\uff1a\u5982\u679c $a[i-1] \u548c b[j-1]$ \u76f8\u540c\uff0c\u610f\u5473\u7740\u8fd9\u4e24\u4e2a\u5b57\u7b26\u53ef\u4ee5\u4f5c\u4e3a\u516c\u5171\u5b50\u5e8f\u5217\u7684\u4e00\u90e8\u5206\u3002\u56e0\u6b64\uff0c$dp[i][j]$ \u5e94\u8be5\u7b49\u4e8e $dp[i-1][j-1] + 1$\uff0c\u5373\u7ee7\u627f\u81ea\u524d\u4e00\u4e2a\u5b50\u95ee\u9898\u7684\u89e3\uff0c\u5e76\u52a0\u4e0a\u5f53\u524d\u5b57\u7b26\u3002<\/p>\n\n\n\n
\u5982\u679c\u5b57\u7b26\u4e0d\u76f8\u7b49<\/strong>\uff1a\u5982\u679c $a[i-1]\u548c b[j-1]$ \u4e0d\u76f8\u540c\uff0c\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217\u5e94\u8be5\u662f\u5ffd\u7565\u5176\u4e2d\u4e00\u4e2a\u5b57\u7b26\u540e\u7684\u6700\u5927\u516c\u5171\u5b50\u5e8f\u5217\u957f\u5ea6\uff0c\u5373\uff1a$dp[i][j] = max(dp[i-1][j], dp[i][j-1])$\uff0c\u9009\u62e9\u4ece $a$ \u4e2d\u5254\u9664\u4e00\u4e2a\u5b57\u7b26\uff08\u5373 $dp[i-1][j]$\uff09\uff0c\u6216\u8005\u4ece $b$ \u4e2d\u5254\u9664\u4e00\u4e2a\u5b57\u7b26\uff08\u5373 $dp[i][j-1]$\uff09\uff0c\u53d6\u4e24\u8005\u4e2d\u7684\u6700\u5927\u503c\u3002<\/p>\n\n\n\n
\u7b80\u800c\u8a00\u4e4b\uff1a\u5982\u679c\u76f8\u7b49\uff0c\u90a3\u4e48\u5f53\u524d\u7684\u516c\u5171\u5b50\u5e8f\u5217\u957f\u5ea6\u5c31\u662f\u524d\u4e00\u4e2a\u5b50\u95ee\u9898\u7684\u957f\u5ea6\u52a0\u4e00 $dp[i][j] = dp[i – 1][j – 1] + 1$\uff1b\u5982\u679c\u4e0d\u76f8\u7b49\uff0c\u5f53\u524d\u7684\u516c\u5171\u5b50\u5e8f\u5217\u957f\u5ea6\u5c31\u662f\u524d\u9762\u4e24\u4e2a\u5b50\u95ee\u9898\u7684\u6700\u5927\u503c $dp[i][j] = max(dp[i][j – 1],dp[i – 1][j])$\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++ dp\u90e8\u5206\u5c55\u5f00\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXX = 1e3;\nint dp[MAXX][MAXX];\nint len1;\nint len2;\n\nvoid solve(string a,string b){\n    len1 = a.size();\n    len2 = b.size();\n    for(int i = 0;i < len1;i++){\n        for(int j = 0;j < len2;j++){\n            dp[i][j] = 0;\n        }\n    }\n    for(int i = 1;i <= len1;i++){\n        for(int j = 1;j <= len2;j++){\n            if(a[i - 1] == b[j - 1]){\n                dp[i][j] = dp[i - 1][j - 1] + 1;\n            } else if(dp[i - 1][j] > dp[i][j - 1]){\n                dp[i][j] = dp[i - 1][j];\n            } else{\n                dp[i][j] = dp[i][j - 1];\n            }\n        }\n    }\n    cout << dp[len1][len2] << \"\\n\";\n}\nint main(){\n    string a,b;\n    while(cin >> a >> b){\n        solve(a,b);\n    }\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801C++ dp\u90e8\u5206\u4e0d\u5c55\u5f00\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXX = 1e3;\nint dp[MAXX][MAXX];\nint len1;\nint len2;\n\nvoid solve(string a,string b){\n    len1 = a.size();\n    len2 = b.size();\n    for(int i = 0;i < len1;i++){\n        for(int j = 0;j < len2;j++){\n            dp[i][j] = 0;\n        }\n    }\n    for(int i = 1;i <= len1;i++){\n        for(int j = 1;j <= len2;j++){\n            if(a[i - 1] == b[j - 1]){\n                dp[i][j] = dp[i - 1][j - 1] + 1;\n            }else{\n                dp[i][j] = max(dp[i][j - 1],dp[i - 1][j]);\n            }\n        }\n    }\n    cout << dp[len1][len2] << \"\\n\";\n}\nint main(){\n    string a,b;\n    while(cin >> a >> b){\n        solve(a,b);\n    }\n}<\/code><\/pre>\n\n\n\n
D005 \u966a\u5ba1\u56e2\u7684\u4eba\u9009<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5728\u9065\u8fdc\u7684\u56fd\u5bb6\u4f5b\u7f57\u5e03\u5c3c\u4e9a\uff0c\u5acc\u72af\u662f\u5426\u6709\u7f6a\uff0c\u987b\u7531\u966a\u5ba1\u56e2\u51b3\u5b9a\u3002\u966a\u5ba1\u56e2\u662f\u7531\u6cd5\u5b98\u4ece\u516c\u4f17\u4e2d\u6311\u9009\u7684\u3002\u5148\u968f\u673a\u6311\u9009n\u4e2a\u4eba\u4f5c\u4e3a\u966a\u5ba1\u56e2\u7684\u5019\u9009\u4eba\uff0c\u7136\u540e\u518d\u4ece\u8fd9n\u4e2a\u4eba\u4e2d\u9009m\u4eba\u7ec4\u6210\u966a\u5ba1\u56e2\u3002\u9009m\u4eba\u7684\u529e\u6cd5\u662f\uff1a \u63a7\u65b9\u548c\u8fa9\u65b9\u4f1a\u6839\u636e\u5bf9\u5019\u9009\u4eba\u7684\u559c\u6b22\u7a0b\u5ea6\uff0c\u7ed9\u6240\u6709\u5019\u9009\u4eba\u6253\u5206\uff0c\u5206\u503c\u4ece0\u523020\u3002\u4e3a\u4e86\u516c\u5e73\u8d77\u89c1\uff0c\u6cd5\u5b98\u9009\u51fa\u966a\u5ba1\u56e2\u7684\u539f\u5219\u662f\uff1a\u9009\u51fa\u7684m\u4e2a\u4eba\uff0c\u5fc5\u987b\u6ee1\u8db3\u8fa9\u65b9\u603b\u5206\u548c\u63a7\u65b9\u603b\u5206\u7684\u5dee\u7684\u7edd\u5bf9\u503c\u6700\u5c0f\u3002\u5982\u679c\u6709\u591a\u79cd\u9009\u62e9\u65b9\u6848\u7684\u8fa9\u65b9\u603b\u5206\u548c\u63a7\u65b9\u603b\u5206\u7684\u4e4b\u5dee\u7684\u7edd\u5bf9\u503c\u76f8\u540c\uff0c\u90a3\u4e48\u9009\u8fa9\u63a7\u53cc\u65b9\u603b\u5206\u4e4b\u548c\u6700\u5927\u7684\u65b9\u6848\u5373\u53ef\u3002\u6700\u7ec8\u9009\u51fa\u7684\u65b9\u6848\u79f0\u4e3a\u966a\u5ba1\u56e2\u65b9\u6848\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u542b\u591a\u7ec4\u6570\u636e\u3002\u6bcf\u7ec4\u6570\u636e\u7684\u7b2c\u4e00\u884c\u662f\u4e24\u4e2a\u6574\u6570n\u548cm\uff0cn\u662f\u5019\u9009\u4eba\u6570\u76ee\uff0cm\u662f\u966a\u5ba1\u56e2\u4eba\u6570\u3002\u6ce8\u610f\uff0c1<=n<=200, 1<=m<=20\u800c\u4e14m<=n\u3002\u63a5\u4e0b\u6765\u7684n\u884c\uff0c\u6bcf\u884c\u8868\u793a\u4e00\u4e2a\u5019\u9009\u4eba\u7684\u4fe1\u606f\uff0c\u5b83\u5305\u542b2\u4e2a\u6574\u6570\uff0c\u5148\u540e\u662f\u63a7\u65b9\u548c\u8fa9\u65b9\u5bf9\u8be5\u5019\u9009\u4eba\u7684\u6253\u5206\u3002\u5019\u9009\u4eba\u6309\u51fa\u73b0\u7684\u5148\u540e\u4ece1\u5f00\u59cb\u7f16\u53f7\u3002\u4e24\u7ec4\u6709\u6548\u6570\u636e\u4e4b\u95f4\u4ee5\u7a7a\u884c\u5206\u9694\u3002\u6700\u540e\u4e00\u7ec4\u6570\u636en=m=0\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u7ec4\u6570\u636e\uff0c\u5148\u8f93\u51fa\u4e00\u884c\uff0c\u8868\u793a\u7b54\u6848\u6240\u5c5e\u7684\u7ec4\u53f7, \u5982 ‘Jury #1’, ‘Jury #2’, \u7b49\u3002\u63a5\u4e0b\u6765\u7684\u4e00\u884c\u8981\u8c61\u4f8b\u5b50\u90a3\u6837\u8f93\u51fa\u966a\u5ba1\u56e2\u7684\u63a7\u65b9\u603b\u5206\u548c\u8fa9\u65b9\u603b\u5206\u3002\u518d\u4e0b\u6765\u4e00\u884c\u8981\u4ee5\u5347\u5e8f\u8f93\u51fa\u966a\u5ba1\u56e2\u91cc\u6bcf\u4e2a\u6210\u5458\u7684\u7f16\u53f7\uff0c\u4e24\u4e2a\u6210\u5458\u7f16\u53f7\u4e4b\u95f4\u7528\u7a7a\u683c\u5206\u9694\u3002\u6bcf\u7ec4\u8f93\u51fa\u6570\u636e\u987b\u4ee5\u4e00\u4e2a\u7a7a\u884c\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
4 2
1 2
2 3
4 1
6 2
0 0<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
Jury #1
Best jury has value 6 for prosecution and value 4 for defence:
2 3<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9898\u96be\u8bfb\u4e14\u96be\u5199\uff0c\u63a8\u8350\u8df3\u8fc7\u3010\u3002\u3011\u3002\u4f46\u662f\u5176\u5b9e\u5c31\u662f\u4e2a01\u80cc\u5305\uff0c\u6bcf\u4e2a\u4eba\u8981\u4e48\u88ab\u9009\u62e9\u8981\u4e48\u4e0d\u88ab\u9009\u62e9\u3002<\/p>\n\n\n\n
\u601d\u8def\u8bf7\u53c2\u8003\uff1aPOJ 1015 Jury Compromise \uff08\u5b8c\u5168\u80cc\u5305\uff09 – RioTian – \u535a\u5ba2\u56ed (cnblogs.com)<\/a><\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\n\nconst int OFFSET = 400;\nconst int MAX_DIFF = 800;\nconst int MAX_N = 205;\nconst int MAX_M = 25;\n\nint f[MAX_M][MAX_DIFF + 1];  \/\/ \u52a8\u6001\u89c4\u5212\u8868\nint d[MAX_N][MAX_M][MAX_DIFF + 1]; \/\/ \u8def\u5f84\u8bb0\u5f55\nint n, m, a[MAX_N], b[MAX_N], suma, sumb, T;\nvector<int> c;\n\nvoid get_path(int i, int j, int k) {\n    if (j == 0) return;\n    int last = d[i][j][k];\n    get_path(last - 1, j - 1, k - (a[last] - b[last]));\n    c.push_back(last);\n    suma += a[last];\n    sumb += b[last];\n}\n\nint main() {\n    T = 1;\n    while (true) {\n        cin >> n >> m;\n        if (n == 0 && m == 0) break;\n\n        \/\/ \u8bfb\u5165\u5019\u9009\u4eba\u7684\u63a7\u65b9\u548c\u8fa9\u65b9\u5206\u6570\n        for (int i = 1; i <= n; ++i) {\n            cin >> a[i] >> b[i];\n        }\n\n        \/\/ \u521d\u59cb\u5316\u52a8\u6001\u89c4\u5212\u8868\n        memset(f, -0x3f, sizeof(f)); \/\/ -INF\n        f[0][OFFSET] = 0; \/\/ \u5e73\u79fb\u5230 OFFSET\n\n        \/\/ \u52a8\u6001\u89c4\u5212\u8fc7\u7a0b\n        for (int i = 1; i <= n; ++i) {\n            \/\/ \u4e0d\u9009\u62e9\u7b2c i \u4e2a\u4eba\n            for (int j = 0; j <= m; ++j) {\n                for (int k = 0; k <= MAX_DIFF; ++k) {\n                    d[i][j][k] = d[i - 1][j][k];\n                }\n            }\n            \/\/ \u9009\u62e9\u7b2c i \u4e2a\u4eba\n            for (int j = m; j > 0; --j) {\n                for (int k = 0; k <= MAX_DIFF; ++k) {\n                    int diff = a[i] - b[i];\n                    if (k - diff < 0 || k - diff > MAX_DIFF) continue; \/\/ \u8d85\u51fa\u8303\u56f4\n                    if (f[j][k] < f[j - 1][k - diff] + a[i] + b[i]) {\n                        f[j][k] = f[j - 1][k - diff] + a[i] + b[i];\n                        d[i][j][k] = i;\n                    }\n                }\n            }\n        }\n\n        \/\/ \u5bfb\u627e\u6700\u4f73\u89e3\n        int ans = 0;\n        for (int k = 0; k <= OFFSET; ++k) {\n            if (f[m][OFFSET + k] >= 0 && f[m][OFFSET + k] >= f[m][OFFSET - k]) {\n                ans = k + OFFSET;\n                break;\n            }\n            if (f[m][OFFSET - k] >= 0) {\n                ans = OFFSET - k;\n                break;\n            }\n        }\n\n        \/\/ \u6062\u590d\u8def\u5f84\n        c.clear();\n        suma = sumb = 0;\n        get_path(n, m, ans);\n\n        \/\/ \u8f93\u51fa\n        cout << \"Jury #\" << T++ << endl;\n        cout << \"Best jury has value \" << suma << \" for prosecution and value \" << sumb << \" for defence:\" << \"\\n\";\n        for (size_t i = 0; i < c.size(); ++i) {\n            if (i > 0) cout << \" \";\n            cout << c[i];\n        }\n        cout << \"\\n\\n\";\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
D006 \u6700\u5927\u548c<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u5b9a\u4e00\u4e2an\u4e2a\u6574\u6570\u7684\u96c6\u5408\uff1aA={a1, a2,…, an}\uff0c\u6211\u4eec\u5982\u4e0b\u5b9a\u4e49\u51fd\u6570d(A)\uff1a<\/p>\n\n\n\n
\"D006.png\"<\/div><\/figure>\n\n\n\n
\u4f60\u7684\u4efb\u52a1\u5c31\u662f\u8ba1\u7b97\u51fd\u6570d(A)\u7684\u51fd\u6570\u503c\u3002 \u63d0\u793a\uff1a\u5bf9\u4e8e\u6837\u4f8b\uff0c\u6211\u4eec\u9009\u62e9{2,2,3,-3,4} \u548c {5}\uff0c\u8fdb\u884c\u60f3\u52a0\u5f97\u5230\u51fd\u6570d(A)\u7684\u51fd\u6570\u503c\u3002 \u8f93\u5165\u91cf\u5927\uff0c\u5efa\u8bae\u4f7f\u7528scanf();<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u542b T(<=30)\u4e2a\u6837\u4f8b\uff0c\u5728\u8f93\u5165\u7684\u7b2c\u4e00\u884c\u5373\u662f\u6574\u6570T\u3002\u6bcf\u4e2a\u6837\u4f8b\u5305\u542b\u4e24\u884c\uff0c\u7b2c\u4e00\u884c\u662f\u6574\u6570 n(2<=n<=50000)\uff0c\u7b2c\u4e8c\u884c\u5305\u542b\u4e86n\u4e2a\u6574\u6570\uff1a a1, a2, …, an. (|ai| <= 10000)\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e2a\u8f93\u5165\u6837\u4f8b\uff0c\u8f93\u51fa\u4e00\u884c\uff0c\u5373\u5982\u4e0a\u5b9a\u4e49\u51fd\u6570d(A)\u7684\u51fd\u6570\u503c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
1
10
1 -1 2 2 3 -3 4 -4 5 -5<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
13<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u5176\u5b9e\u5c31\u662f\u627e\u4e00\u4e2a\u4e34\u754c\u70b9\uff0c\u5408\u5e76\u4e00\u4e2a\u6700\u5927\u7684\u524d\u7f00\u5b50\u6570\u7ec4\u548c+\u6700\u5927\u7684\u540e\u7f00\u5b50\u6570\u7ec4\u548c\u3002<\/p>\n\n\n\n
\u5982\u679c\u80fd\u60f3\u660e\u767d\u8fd9\u4ef6\u4e8b\uff0c\u90a3\u8fd9\u9053\u9898\u5c31\u4e0d\u96be\u4e86\uff0c\u4e5f\u5c31\u662f\u524d\u540e\u4e24\u6b21\u626b\u63cf\uff0c\u7136\u540e\u7c7b\u4f3c\u4e8e\u6c42\u6700\u5927\u7684\u5b50\u6570\u7ec4\u548c\u8fd9\u4ef6\u4e8b\u53bb\u5904\u7406\uff0c\u6700\u540e\u518d\u62fc\u63a5\u8d77\u6765\u3002<\/p>\n\n\n\n
\u5373\u5bfb\u627e\u4e24\u4e2a\u4e0d\u76f8\u4ea4\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++ \u7b2c\u4e00\u7248\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXX = 2e5;\nconst int INF = 0x3f3f3f3f;\nint a[MAXX];\nint dp1[MAXX];\nint dp2[MAXX];\nint maxx;\n\nvoid solve(){\n    int n;\n    cin >> n;\n    for(int i = 1;i <= n;i++){\n        cin >> a[i];\n        dp1[i] = 0;\n        dp2[i] = 0;\n        maxx = 0;\n    }\n    dp1[0] = -INF;\n    int sum = 0;\n    for(int i = 1;i <= n;i++){\n        dp1[i] = max(dp1[i - 1],sum + a[i]);\n        sum += a[i];\n        if(sum < 0){\n            sum = 0;\n        }\n    }\n    \n    dp2[n + 1] = -INF;\n    sum = 0;\n    for(int i = n;i > 0;i--){\n        dp2[i] = max(dp2[i + 1],sum + a[i]);\n        sum += a[i];\n        if(sum < 0){\n            sum = 0;\n        }\n    }\n    int res = -INF;\n    for(int i = n;i > 0;i--){\n        res = max(res,dp1[i] + dp2[i + 1]);\n    }\n    cout << res << \"\\n\";\n}\n\nint main(){\n    ios::sync_with_stdio(false);\n    cin.tie(0);\n    int t;\n    cin >> t;\n    while(t--) solve();\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801C++ \u7b2c\u4e8c\u7248\uff1a<\/h3>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\n\nconst int MAXX = 2e5;\nconst int INF = 0x3f3f3f3f;\nint a[MAXX];\nint dp1[MAXX];\nint dp2[MAXX];\n\nvoid solve(){\n    int n;\n    cin >> n;\n    for(int i = 1; i <= n; i++){\n        cin >> a[i];\n    }\n\n    int sum = 0;\n    dp1[0] = -INF;\n    for(int i = 1; i <= n; i++){\n        dp1[i] = max(dp1[i - 1], sum + a[i]);\n        sum = max(0, sum + a[i]);\n    }\n\n    sum = 0;\n    dp2[n + 1] = -INF;\n    for(int i = n; i > 0; i--){\n        dp2[i] = max(dp2[i + 1], sum + a[i]);\n        sum = max(0, sum + a[i]);\n    }\n\n    int res = -INF;\n    for(int i = 1; i < n; i++){\n        res = max(res, dp1[i] + dp2[i + 1]);\n    }\n\n    cout << res << \"\\n\";\n}\n\nint main(){\n    ios::sync_with_stdio(false);\n    cin.tie(0);\n    int t;\n    cin >> t;\n    while(t--) solve();\n}<\/code><\/pre>\n\n\n\n
D007 \u6700\u5927\u5b50\u77e9\u9635<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u4f60\u4e00\u4e2a\u4e8c\u7ef4\u77e9\u9635\uff0c\u5143\u7d20\u662f\u6574\u6570\uff0c\u6709\u6b63\u6709\u8d1f\u3002\u4e00\u4e2a\u5b50\u77e9\u9635\u5c31\u662f\u6700\u5c0f1*1\u6700\u5927\u5305\u542b\u8fd9\u4e2a\u77e9\u9635\u672c\u8eab\u7684\u77e9\u9635\u3002\u4e00\u4e2a\u77e9\u9635\u7684\u548c\u5c31\u662f\u77e9\u9635\u4e2d\u6240\u6709\u5143\u7d20\u6c42\u548c\uff0c\u6700\u5927\u5b50\u77e9\u9635\u5c31\u662f\u6240\u6709\u5b50\u77e9\u9635\u4e2d\u548c\u6700\u5927\u7684\u90a3\u4e2a\u5b57\u77e9\u9635\u3002\u4e0b\u9762\u662f\u4e00\u4e2a\u4f8b\u5b50\uff1a 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2 \u6700\u5927\u5b50\u77e9\u9635\u5728\u5de6\u4e0b\u89d2 9 2 -4 1 -1 8 \u548c\u503c\u662f15\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u7684\u7b2c\u4e00\u884c\u662f\u6574\u6570N\uff0c\u5373\u8868\u793a\u8981\u8f93\u5165\u4e00\u4e2aN * N\u7684\u6574\u6570\u77e9\u9635\u3002\u63a5\u4e0b\u6765\u662fN^2 \u4e2a\u6574\u6570\uff0c\u6bcf\u4e2a\u6574\u6570\u4e4b\u95f4\u88ab\u7a7a\u683c\u6216\u8005\u7a7a\u884c\u5206\u5f00\uff0c\u8fd9\u4e9b\u6574\u6570\u5373\u4e3a\u77e9\u9635\u4e2d\u7684\u6570\uff0c\u6309\u7167\u5217\u4f18\u5148\u7684\u987a\u5e8f\u6392\u5217\uff0c\u5373\u7b2c\u4e00\u884c\u6574\u6570\u4ece\u5de6\u81f3\u53f3\u8f93\u5165\uff0c\u7b2c\u4e8c\u884c\u4ece\u5de6\u81f3\u53f3\u8f93\u5165\u2026. \u7b2cn\u884c\u4ece\u5de6\u81f3\u53f3\u8f93\u5165\u3002N\u4e0d\u4f1a\u5927\u4e8e100\uff0c\u77e9\u9635\u4e2d\u7684\u6574\u6570\u8303\u56f4\u4e3a [-127,127]\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fa\u6700\u5927\u77e9\u9635\u7684\u548c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
4
0 -2 -7 0 9 2 -6 2
-4 1 -4  1 -1 8  0 -2<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
15<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9898\u5176\u5b9e\u662f\u6c42\u6700\u5927\u5b50\u6bb5\u548c\u7684\u5ef6\u7533\u9898\u76ee\uff0c\u4f46\u662fOJ\u4e0a\u6ca1\u6709\u8fd9\u4e2a\u524d\u7f6e\u9898\u76ee\u3002<\/p>\n\n\n\n
\u6700\u5927\u5b50\u6bb5\u548c\u5c31\u662f\u6c42\u4e00\u884c\u6570\u5b57\u91cc\uff0c\u67d0\u4e00\u6bb5\u6570\u5b57\u7684\u548c\u662f\u6700\u5927\u7684\u3002\u90a3\u4e2a\u95ee\u9898\u7684\u8f6c\u79fb\u65b9\u7a0b\u5c31\u662f\uff1a$b[j]=max({b[j-1]+a[j], a[j]})$<\/p>\n\n\n\n
$b[j]$ \u662f\u5b58\u50a8\u6700\u5927\u548c\uff0c$a[j]$ \u662f\u539f\u6570\u7ec4\u3002<\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u7136\u540e\u73b0\u5728\u6211\u4eec\u628a\u8fd9\u4e2a\u6700\u5927\u5b50\u77e9\u9635\u7684\u95ee\u9898\u538b\u7f29\u4e00\u4e0b\uff0c\u4e5f\u5c31\u662fn\u4e2a\u6700\u5927\u5b50\u77e9\u9635\u95ee\u9898\u3002\u3010\u76f4\u63a5\u770b\u4ee3\u7801\u5427\u3011<\/p>\n\n\n\n
\u7136\u540e\u7b14\u8005\u53d1\u73b0\u8fd9\u9053\u9898\u5728OJ\u4e0a\uff0c\u4e0d\u8bba\u662f\u66b4\u529b\u8fd8\u662f\u52a8\u6001\u89c4\u5212\u7684\u5199\u6cd5\u90fd\u80fd\u901a\u8fc7\uff0c\u8bfb\u8005\u53ef\u4ee5\u81ea\u884c\u6289\u62e9\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++ \u66b4\u529b\u7248\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\n\nint mx[100][100];\n\nint main() {\n    int n;\n    cin >> n;\n    for(int i = 0; i < n; i++)\n        for(int j = 0; j < n; j++)\n            cin >> mx[i][j];\n\n    int maxSum = INT_MIN;\n\n    for(int i = 0; i < n; i++) {\n        for(int j = i; j < n; j++) {\n            for(int k = 0; k < n; k++) {\n                for(int l = k; l < n; l++) {\n                    int sum = 0;\n                    for(int p = i; p <= j; p++) {\n                        for(int q = k; q <= l; q++) {\n                            sum += mx[p][q];\n                        }\n                    }\n                    maxSum = max(maxSum, sum);\n                }\n            }\n        }\n    }\n\n    cout << maxSum << \"\\n\";\n    return 0;\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801C++ \u52a8\u6001\u89c4\u5212\u7248\uff1a<\/h3>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\n\nint mx[100][100];\nint temp[100];\nint dp[100];\n\nint maxx = -0x3f3f3f3f;\n\nint main() {\n    int n;\n    cin >> n;\n    for (int i = 0; i < n; i++) {\n        for (int j = 0; j < n; j++) {\n            cin >> mx[i][j];\n        }\n    }\n\n    for (int i = 0; i < n; i++) {\n        memset(temp, 0, sizeof(temp));\n        for (int j = i; j < n; j++) {\n            \/\/ \u66f4\u65b0temp\u6570\u7ec4\n            for (int k = 0; k < n; k++) {\n                temp[k] += mx[j][k];\n            }\n\n            \/\/ \u6c42\u6700\u5927\u5b50\u6bb5\u548c\n            int sum = 0;\n            for (int k = 0; k < n; k++) {\n                if (sum > 0) {\n                    sum += temp[k];\n                } else {\n                    sum = temp[k];\n                }\n                maxx = max(maxx, sum);\n            }\n        }\n    }\n\n    cout << maxx << \"\\n\";\n\n    return 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u524d\u8a00 \u8fd9\u4e00\u7ae0\u662f\u52a8\u6001\u89c4\u5212\uff0c\u7406\u89e3\u4e0a\u53ef\u80fd\u4f1a\u6bd4\u8f83\u6666\u6da9\uff0c\u4f46\u662f\u8fd8\u662f\u5e0c\u671b\u8bfb\u8005\u80fd\u5c3d\u91cf\u53bb\u7406\u89e3\u5176\u4e2d\u7684\u7cbe\u534e\u3002 D001 \u6570\u5b57\u4e09\u89d2\u5f62  […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,12],"tags":[],"class_list":["post-319","post","type-post","status-publish","format-standard","hentry","category-nenuoj-2","category-12"],"_links":{"self":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/319","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=319"}],"version-history":[{"count":14,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/319\/revisions"}],"predecessor-version":[{"id":390,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/319\/revisions\/390"}],"wp:attachment":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/media?parent=319"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/categories?post=319"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/tags?post=319"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}