{"id":192,"date":"2019-03-20T22:43:27","date_gmt":"2019-03-20T14:43:27","guid":{"rendered":"http:\/\/47.240.37.220\/?p=192"},"modified":"2019-03-20T22:43:31","modified_gmt":"2019-03-20T14:43:31","slug":"%e6%9c%80%e5%b0%8f%e8%b4%b9%e7%94%a8%e6%9c%80%e5%a4%a7%e6%b5%81","status":"publish","type":"post","link":"https:\/\/blog.inhowe.com\/index.php\/2019\/03\/20\/%e6%9c%80%e5%b0%8f%e8%b4%b9%e7%94%a8%e6%9c%80%e5%a4%a7%e6%b5%81\/","title":{"rendered":"\u6700\u5c0f\u8d39\u7528\u6700\u5927\u6d41"},"content":{"rendered":"\n<p>\u8fd9\u51e0\u5929\u5306\u5fd9\u5b66\u4e60\u4e86\u4e00\u4e0b\u56fe\u8bba\u7684\u76f8\u5173\u77e5\u8bc6\uff0c\u7ecf\u5178\u7684\u89e3\u51b3\u56fe\u8bba\u7684\u4e00\u4e9b\u65b9\u6cd5\u6709\u5927\u6982\u8fd9\u4e9b\uff1aspfa\u7b97\u6cd5\u3001dfs\u7b97\u6cd5\u3001dijisktra\u7b97\u6cd5\u3002<\/p>\n\n\n\n<p>\u800c\u4eca\u5929\u63d0\u5230\u7684\u6700\u5c0f\u8d39\u7528\u6700\u5927\u6d41\u6cd5\u4e5f\u662f\u56fe\u8bba\u91cc\u7684\u4e00\u79cd\u65b9\u6cd5\uff0c MinCostMaxFlow\u6cd5\u4e3b\u8981\u7528\u4e8e\u89e3\u51b3\u8bf8\u5982\u4ea4\u901a\u8fd0\u8f93\u3001\u91d1\u878d\u7b49\u95ee\u9898\u3002\u7b97\u6cd5\u7684\u76ee\u7684\u5f88\u7b80\u5355\uff0c\u5bfb\u627e\u6e90\u70b9\u5230\u6c47\u70b9\u4e4b\u95f4\u6ee1\u8db3\u6700\u5927\u6d41\uff08\u5982\u9053\u8def\u5c3d\u53ef\u80fd\u5b8c\u5168\u5229\u7528\uff09\u4e14\u540c\u65f6\u6ee1\u8db3\u6700\u5c0f\u8d39\u7528\uff08\u5982\u603b\u6cb9\u8d39\u6700\u5c11\uff09\u7684\u8def\u5f84\u3002\u5177\u4f53\u5b9e\u73b0\u7684\u8fc7\u7a0b\u6211\u4e5f\u6ca1\u770b\u4e0d\u61c2\uff0c\u6bd5\u7adf\u662f\u8d76\u9e2d\u5b50\u4e0a\u67b6\uff0c\u53ea\u662f\u4f1a\u7528\u6c34\u5e73\u3002\u6211\u628a\u7f51\u7edc\u4e0a\u7684\u4f8b\u7a0b\u627e\u6765\u8fdb\u884c\u4e86\u4fee\u6539\uff0c\u63d0\u53d6\u51fa\u4e86\u8def\u5f84<\/p>\n\n\n\n<p> MinCostMaxFlow\u7b97\u6cd5\u662f\u4e0d\u80fd\u76f4\u63a5\u8f93\u51fa\u8def\u5f84\u7684\uff0c\u4f46\u662f\u8def\u5f84\u4fe1\u606f\u5176\u5b9e\u53ef\u4ee5\u5728\u7b97\u6cd5\u8fd0\u884c\u5b8c\u6bd5\u540e\uff0c\u4ece\u201c\u8fb9\u96c6\u5408\u201d\u53d8\u91cf\u91cc\u7684\u76f8\u5173\u4fe1\u606f\u5206\u6790\u63d0\u53d6\u51fa\u6765\u3002\u6211\u7684\u5de5\u4f5c\u5c31\u662f\u5199\u4e86\u8fd9\u4e48\u4e00\u4e2a\u51fd\u6570\u3002\u76f4\u63a5\u8d34\u4ee3\u7801\u4e86\u3002<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>#include &lt;iostream>\n#include &lt;stdio.h>\n#include &lt;vector>\n#include &lt;string>\n#include &lt;stdlib.h>\n#include &lt;queue>\n#include &lt;stack>\n#include &lt;cstring>\nusing namespace std;\nconst int INF = 0x3f3f3f3f;\/\/\u5b9a\u4e49\u4e00\u4e2a\u5927\u6570\u8868\u793a\u65e0\u7a77\u91cf\uff0c\u4e3a\u4ec0\u4e48\u662f3f?\nconst int maxn = 30;\/\/ \u5b9a\u4e49\u6700\u5927\u7ed3\u70b9\u6570\uff0c\u6700\u597d\u662fn\u7684\u4e24\u500d\u8fd8\u662f1\u500d\u5462\uff1f\n\/\/\u8fb9\nstruct edge\n{\n    \/\/\u524d\u7ed3\u70b9u,\u540e\u7ed3\u70b9v,\u5bb9\u91cfc,\u6d41\u91cff,\u8d39\u7528cost\n    int u, v, c, f, cost;\n    edge(int u, int v, int c, int f, int cost):u(u), v(v), c(c), f(f), cost(cost){}\n};\nstatic vector&lt;edge>e;\/\/\u8fb9\u7684\u96c6\u5408\nstatic vector&lt;int>G[maxn];\/\/\u56fe\nstatic int a[maxn];\/\/\u627e\u589e\u5e7f\u8def\u6bcf\u4e2a\u70b9\u7684\u6c34\u6d41\u91cf\uff0c\u72b6\u6001\u53d8\u91cf\uff0c\u8bb0\u5f55\u6d41\u91cf\nstatic int p[maxn];\/\/\u6bcf\u6b21\u627e\u589e\u5e7f\u8def\u53cd\u5411\u8bb0\u5f55\u8def\u5f84\uff0c\u4e0d\u77e5\u9053\u4ec0\u4e48\u7528\nstatic int d[maxn];\/\/SPFA\u7b97\u6cd5\u7684\u6700\u77ed\u8def\uff0c\u4e0d\u61c2\nstatic int inq[maxn];\/\/SPFA\u7b97\u6cd5\u662f\u5426\u5728\u961f\u5217\u4e2d,\u4e2d\u95f4\u53d8\u91cf\uff0c\u65e0\u7528\nstatic int n, m;\/\/n=\u7ed3\u70b9\u6570\n\n\/\/\u521d\u59cb\u5316\uff0cn=\u7ed3\u70b9\u6570\nvoid init(int n)\n{\n    for(int i = 0; i &lt;= n; i++)G[i].clear();\n    e.clear();\n}\n\n\/\/\u6dfb\u52a0\u8fb9\uff0c\u7528\u4e8e\u6784\u9020\u56fe\n\/\/u-\u8fb9\u7684\u5de6\u7ed3\u70b9\uff0cv-\u8fb9\u7684\u53f3\u7ed3\u70b9\uff0cc-\u8fb9\u7684\u5bb9\u91cf\uff0ccost-\u8fb9\u7684\u82b1\u8d39\nvoid addedge(int u, int v, int c, int cost)\n{\n    e.push_back(edge(u, v, c, 0, cost));\/\/\u6b63\u5411\n    e.push_back(edge(v, u, c, 0, cost));\/\/\u53cd\u5411\uff0c\u628ac\u6362\u62100\u8868\u793a\u8fd9\u662f\u4e00\u4e2a\u5355\u5411\u8fb9\n    int m = e.size();\n    G[u].push_back(m - 2);\n    G[v].push_back(m - 1);\n}\n\n\/\/s\u6e90\u70b9\uff0ct\u6c47\u70b9\uff0cflow\u6d41\u7ed3\u679c\uff0ccost\u8d39\u7528\u7ed3\u679c\n\/\/\u4e2d\u95f4\u51fd\u6570\uff0c\u4e0d\u7528\u7ba1\uff0c\u4f46\u662f\u662f\u6838\u5fc3\nbool bellman(int s, int t, int&amp; flow, long long &amp; cost)\n{\n    for(int i = 0; i &lt;= n + 1; i++)d[i] = INF;\/\/Bellman\u7b97\u6cd5\u7684\u521d\u59cb\u5316\n    memset(inq, 0, sizeof(inq));\n    d[s] = 0;inq[s] = 1;\/\/\u6e90\u70b9s\u7684\u8ddd\u79bb\u8bbe\u4e3a0\uff0c\u6807\u8bb0\u5165\u961f\n    p[s] = 0;a[s] = INF;\/\/\u6e90\u70b9\u6d41\u91cf\u4e3aINF\uff08\u548c\u4e4b\u524d\u7684\u6700\u5927\u6d41\u7b97\u6cd5\u662f\u4e00\u6837\u7684\uff09\n\n    queue&lt;int>q;\/\/Bellman\u7b97\u6cd5\u548c\u589e\u5e7f\u8def\u7b97\u6cd5\u540c\u6b65\u8fdb\u884c\uff0c\u6cbf\u7740\u6700\u77ed\u8def\u62d3\u5c55\u589e\u5e7f\u8def\uff0c\u5f97\u51fa\u7684\u89e3\u4e00\u5b9a\u662f\u6700\u5c0f\u8d39\u7528\u6700\u5927\u6d41\n    q.push(s);\n    while(!q.empty())\n    {\n        int u = q.front();\n        q.pop();\n        inq[u] = 0;\/\/\u5165\u961f\u5217\u6807\u8bb0\u5220\u9664\n        for(int i = 0; i &lt; G[u].size(); i++)\n        {\n            edge &amp; now = e[G[u][i]];\n            int v = now.v;\n            if(now.c > now.f &amp;&amp; d[v] > d[u] + now.cost)\n                \/\/now.c > now.f\u8868\u793a\u8fd9\u6761\u8def\u8fd8\u672a\u6d41\u6ee1\uff08\u548c\u6700\u5927\u6d41\u4e00\u6837\uff09\n                \/\/d[v] > d[u] + e.cost Bellman \u7b97\u6cd5\u4e2d\u8fb9\u7684\u677e\u5f1b\n            {\n                d[v] = d[u] + now.cost;\/\/Bellman \u7b97\u6cd5\u8fb9\u7684\u677e\u5f1b\n                p[v] = G[u][i];\/\/\u53cd\u5411\u8bb0\u5f55\u8fb9\u7684\u7f16\u53f7\n                a[v] = min(a[u], now.c - now.f);\/\/\u5230\u8fbev\u70b9\u7684\u6c34\u91cf\u53d6\u51b3\u4e8e\u8fb9\u5269\u4f59\u7684\u5bb9\u91cf\u548cu\u70b9\u7684\u6c34\u91cf\n                if(!inq[v]){q.push(v);inq[v] = 1;}\/\/Bellman \u7b97\u6cd5\u5165\u961f\n            }\n        }\n    }\n    if(d[t] == INF)return false;\/\/\u627e\u4e0d\u5230\u589e\u5e7f\u8def\n    flow += a[t];\/\/\u6700\u5927\u6d41\u7684\u503c\uff0c\u6b64\u51fd\u6570\u5f15\u7528flow\u8fd9\u4e2a\u503c\uff0c\u6700\u540e\u53ef\u4ee5\u76f4\u63a5\u6c42\u51faflow\n    cost += (long long)d[t] * (long long)a[t];\/\/\u8ddd\u79bb\u4e58\u4e0a\u5230\u8fbe\u6c47\u70b9\u7684\u6d41\u91cf\u5c31\u662f\u8d39\u7528\n    for(int u = t; u != s; u = e[p[u]].u)\/\/\u9006\u5411\u5b58\u8fb9\n    {\n        e[p[u]].f += a[t];\/\/\u6b63\u5411\u8fb9\u52a0\u4e0a\u6d41\u91cf\n        e[p[u] ^ 1].f -= a[t];\/\/\u53cd\u5411\u8fb9\u51cf\u53bb\u6d41\u91cf \uff08\u548c\u589e\u5e7f\u8def\u7b97\u6cd5\u4e00\u6837\uff09\n    }\n    return true;\n}\n\n\/\/\u6700\u5c0f\u6700\u5927\u6d41\u7b97\u6cd5\uff0c\u6784\u9020\u56fe\u540e\u8c03\u7528\u5b83\u5373\u53ef\n\/\/\u8fd4\u56de\u6700\u5927\u6d41\u7684\u503c\n\/\/s\u6e90\u70b9\uff0ct\u6c47\u70b9\uff0ccost\u8fd4\u56de\u603b\u8d39\u7528\n\/\/\u8be5\u7b97\u6cd5\u8fd0\u884c\u7ed3\u675f\u540e\uff0c\u4e0d\u76f4\u63a5\u8f93\u51fa\u8def\u5f84\uff0c\u4f46\u662f\u8fb9\u96c6\u5408e\u7684f\u53d1\u751f\u66f4\u65b0\uff0c\u53ef\u901a\u8fc7e\u96c6\u5408\u5bfb\u627e\u51fa\u8def\u7ebf\nint MincostMaxflow(int s, int t, long long &amp; cost)\n{\n    cost = 0;\n    int flow = 0;\n    while(bellman(s, t, flow, cost));\/\/\u7531\u4e8eBellman\u51fd\u6570\u7528\u7684\u662f\u5f15\u7528\uff0c\u6240\u4ee5\u53ea\u8981\u4e00\u76f4\u8c03\u7528\u5c31\u53ef\u4ee5\u6c42\u51faflow\u548ccost\n    return flow;\/\/\u8fd4\u56de\u6700\u5927\u6d41\uff0ccost\u5f15\u7528\u53ef\u4ee5\u76f4\u63a5\u8fd4\u56de\u6700\u5c0f\u8d39\u7528\n}\n\nstatic vector&lt;queue&lt;int>> allPath;\n\/\/\u4ece\u8fb9\u96c6\u5408e\u4e2d\u63d0\u53d6\u8def\u5f84\n\/\/s-\u6e90\u70b9\uff0ct-\u6c47\u70b9\uff0ce\u8fb9\u96c6\u5408\nvoid ExtractPathFromEdgeSet(int s,int t,vector&lt;edge> e)\n{\n    queue&lt;int> path,backPath;\n    bool ClrFlag=false;\n    int nowNode=s,nextNode=s;\/\/\u4e5f\u53ef\u4ee5\u7406\u89e3\u4e3a\u5de6\u7ed3\u70b9\u548c\u53f3\u7ed3\u70b9\n    path.push(s);\n    \/\/\u627e\u51fa\u5176\u4e2d\u4efb\u610f\u4e00\u4e2a\u53ef\u884c\u8def\u5f84\nagain:\n    for(auto it=e.begin();it!=e.end();++it)\n    {\n        if(it->u==nowNode &amp;&amp; it->f>0)\/\/\u5f53\u524d\u7ed3\u70b9\u6709\u6d41\u91cff>0\uff0c\u8bf4\u660e\u8fd9\u662f\u4e00\u4e2a\u6709\u6d41\u91cf\u7684\u8fb9\n        {\n            path.push(it->v);\/\/\u8bb0\u5f55\u8be5\u8fb9\u7684\u53f3\u7ed3\u70b9\n            if(it->v==t)\/\/\u627e\u5230\u6c47\u70b9\uff0c\u7ed3\u675f\u641c\u7d22\n                break;\/\/search over.\n            nowNode=it->v;\n            goto again;\/\/\u8bb0\u5f55\u5b8c\u6210\u540e\u7ee7\u7eed\u641c\u7d22\u518d\u4e0b\u4e00\u7ea7\u7ed3\u70b9\n        }\n    }\n    allPath.push_back(path);\/\/\u5168\u90e8\u641c\u5b8c\uff0c\u6dfb\u52a0\u8fdb\u8def\u5f84\u96c6\u5408\n\n    \/\/\u641c\u7d22\u5176\u4f59\u7684\u53ef\u884c\u8def\u5f84\n    \/\/\u539f\u7406\uff1a\u6839\u636e\u8def\u5f84\u4e2d\u7684\u7ed3\u70b9\u5c55\u5f00\u641c\u7d22\uff0c\u641c\u7d22\u76ee\u6807\u662f\u5f53\u524d\u7ed3\u70b9\u662f\u5426\u5b58\u5728\u5176\u4ed6\u542b\u6d41\u7684\u7ed3\u70b9\n    \/\/     \u5982\u679c\u6709\uff0c\u5219\u5728\u8868\u4e2d\u628a\u8be5\u7ed3\u70b9\u4e0e\u8def\u5f84\u4e2d\u8be5\u7ed3\u70b9\u4e0e\u4e0b\u7ea7\u7ed3\u70b9\u7684\u6d41\u5f520\uff0c\u8868\u53d1\u751f\u66f4\u65b0\uff0cgoto\u5230\u524d\u9762\u91cd\u65b0\u641c\u7d22\u8def\u5f84\n    \/\/     \u5982\u679c\u65e0\uff0c\u5219\u628a\u8def\u5f84\u4e2d\u7684\u4e0b\u7ea7\u7ed3\u70b9\u4f5c\u4e3a\u5f53\u524d\u7ed3\u70b9\uff0c\u91cd\u590d\u8fd9\u4e2a\u539f\u7406\u3002\n    \/\/NOTE\uff1aflow\u5f520\u610f\u5473\u7740\u963b\u65ad\u4e86\u8fd9\u6761\u9053\u8def\uff0c\u6b64\u65f6\u91cd\u65b0\u641c\u7d22\u8def\u5f84\u5c31\u4e00\u5b9a\u4e0d\u4f1a\u641c\u7d22\u5230\u66fe\u7ecf\u641c\u5230\u8fc7\u7684\u8def\u5f84\n    \/\/      \u662f\u5426\u4f1a\u4e00\u4e0b\u5b50\u963b\u65ad\u8fc7\u591a\u9053\u8def\u5462\uff1f\n    nowNode=path.front();\n    path.pop();\n    nextNode=path.front();\n    backPath=path;\n    path = queue&lt;int>();\n    path.push(s);\nagain2:\n    for(auto it=e.begin();it!=e.end();++it)\n    {\n        if(it->u==nowNode &amp;&amp; it->v == nextNode)\/\/\u627e\u5230\u8def\u5f84\u4e2d\u4e00\u5bf9\u4e0a\u4e0b\u7ed3\u70b9\n        {\n            ClrFlag = false;\n            for(auto it=e.begin();it!=e.end();++it)\/\/\u5224\u65ad\u662f\u5426\u8fd8\u6709\u5176\u4ed6\u7684\u4e0b\u7ed3\u70b9\u4e5f\u5177\u6709\u6d41\n            {\n                if(it->u==nowNode &amp;&amp; it->v!=nextNode &amp;&amp; it->f>0)\n                {\n                    ClrFlag = true;\n                    break;\n                }\n            }\n            if(ClrFlag)\/\/\u627e\u5230\u5176\u4ed6\u7ed3\u70b9\n            {\n                ClrFlag=false;\n                it->f=0;\/\/flow\u6e050,\u8fb9\u96c6\u5408\u53d1\u751f\u66f4\u65b0\uff0c\u5f00\u59cb\u91cd\u65b0\u641c\u7d22\n                nowNode=s;\n                goto again;\n            }\n            else \/\/\u672a\u627e\u5230\u5176\u4ed6\u7ed3\u70b9\uff0c\u9009\u62e9\u4e0b\u7ea7\u7ed3\u70b9\u4f5c\u4e3a\u5f53\u524d\u7ed3\u70b9\uff0c\u91cd\u590d\u8fd9\u4e2a\u539f\u7406\n            {\n               nowNode=nextNode;\n               backPath.pop();\n               nextNode=backPath.front();\n               goto again2;\n            }\n        }\n    }\n}\n\nvoid ConstructTestGraph(void);\n\nint main(int argc,char const* argv[])\n{\n    long long cost;\n    int flow;\n\n    ConstructTestGraph();\n    flow=MincostMaxflow(1,9,cost);\n    ExtractPathFromEdgeSet(1,9,e);\n\n    \/\/\u683c\u5f0f\u5316\u8f93\u51fa\n    queue&lt;int> path;\n    int i=0;\n    cout&lt;&lt;\"Mincost:\"&lt;&lt;cost&lt;&lt;endl&lt;&lt;\"Maxflow:\"&lt;&lt;flow&lt;&lt;endl;\n    while (!allPath.empty()) {\n        path = allPath.back();\n        allPath.pop_back();\n        cout&lt;&lt;\"path \"&lt;&lt;i++&lt;&lt;\":\";\n        while(!path.empty())\n        {\n            cout&lt;&lt;path.front()&lt;&lt;\"-\";\n            path.pop();\n        }\n        cout&lt;&lt;endl;\n    }\n\n    return 0;\n}\n\n\/\/\u6784\u9020\u4e00\u4e2a\u56fe\nvoid ConstructTestGraph(void)\n{\n    m=0;\n\/\/    addedge(1,2,1,1);m++;\n\/\/    addedge(1,3,6,1);m++;\n\/\/    addedge(2,4,1,1);m++;\n\/\/    addedge(2,5,1,1);m++;\n\/\/    addedge(3,6,2,1);m++;\n\/\/    addedge(3,7,3,1);m++;\n\/\/    addedge(6,8,1,1);m++;\n\/\/    addedge(6,9,2,1);m++;\n\/\/    addedge(7,9,3,1);m++;\n\/\/    addedge(3,9,3,1);m++;\n\/\/    addedge(8,10,3,1);m++;\n\/\/    addedge(8,11,3,1);m++;\n\/\/    addedge(11,12,3,1);m++;\n\/\/    addedge(12,9,3,1);m++;\n\/\/    addedge(5,8,3,1);m++;\n\n\/\/    n=12;\n\/\/    addedge(1,5,3,1);m++;\n\/\/    addedge(5,9,2,1);m++;\n\/\/    addedge(2,6,1,1);m++;\n\/\/    addedge(6,10,1,1);m++;\n\/\/    addedge(3,7,1,1);m++;\n\/\/    addedge(7,11,1,1);m++;\n\/\/    addedge(4,8,1,1);m++;\n\/\/    addedge(8,12,2,1);m++;\n\/\/    addedge(1,2,1,1);m++;\n\/\/    addedge(5,6,1,1);m++;\n\/\/    addedge(9,10,2,1);m++;\n\/\/    addedge(2,3,1,1);m++;\n\/\/    addedge(6,7,1,1);m++;\n\/\/    addedge(10,11,2,1);m++;\n\/\/    addedge(3,4,1,1);m++;\n\/\/    addedge(7,8,1,1);m++;\n\/\/    addedge(11,12,2,1);m++;\n\n    n=9;init(n);\n    addedge(1,2,1,1);m++;\n    addedge(1,3,4,1);m++;\n    addedge(3,4,1,1);m++;\n    addedge(3,5,3,1);m++;\n    addedge(5,6,1,1);m++;\n    addedge(5,7,1,1);m++;\n    addedge(5,8,1,1);m++;\n    addedge(6,9,1,1);m++;\n    addedge(7,9,1,1);m++;\n    addedge(8,9,1,1);m++;\n    addedge(4,9,1,1);m++;\n    addedge(2,9,1,1);m++;\n}\n<\/code><\/pre>\n\n\n\n<p>\u53c2\u8003\u6587\u732e\uff1a<a href=\"https:\/\/www.cnblogs.com\/fzl194\/p\/8859308.html\">\u7f51\u7edc\u6d41\uff08\u516d\uff09\u6700\u5c0f\u8d39\u7528\u6700\u5927\u6d41\u95ee\u9898<\/a><br>\u53c2\u8003\u6587\u732e\uff1a<a href=\"https:\/\/artofproblemsolving.com\/community\/c1368h1020435__zkw\">\u8be5\u7b97\u6cd5\u521b\u59cb\u4eba<\/a><br>\u53c2\u8003\u6587\u732e\uff1a<a href=\"https:\/\/zh.wikipedia.org\/wiki\/%E5%9B%BE_(%E6%95%B0%E5%AD%A6)#%E6%9C%AF%E8%AF%AD\">\u56fe\u8bba<\/a><br>\u53c2\u8003\u6587\u732e\uff1a<a href=\"https:\/\/zh.wikipedia.org\/wiki\/%E7%BD%91%E7%BB%9C%E6%B5%81\">\u7f51\u7edc\u6d41<\/a><\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u8fd9\u51e0\u5929\u5306\u5fd9\u5b66\u4e60\u4e86\u4e00\u4e0b\u56fe\u8bba\u7684\u76f8\u5173\u77e5\u8bc6\uff0c\u7ecf\u5178\u7684\u89e3\u51b3\u56fe\u8bba\u7684\u4e00\u4e9b\u65b9\u6cd5\u6709\u5927\u6982\u8fd9\u4e9b\uff1aspfa\u7b97\u6cd5\u3001dfs\u7b97\u6cd5\u3001dijisk&#8230; <\/p>\n<div class=\"read-more navbutton\"><a href=\"https:\/\/blog.inhowe.com\/index.php\/2019\/03\/20\/%e6%9c%80%e5%b0%8f%e8%b4%b9%e7%94%a8%e6%9c%80%e5%a4%a7%e6%b5%81\/\">\u9605\u8bfb\u66f4\u591a<i class=\"fa fa-angle-double-right\"><\/i><\/a><\/div>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[4],"tags":[],"_links":{"self":[{"href":"https:\/\/blog.inhowe.com\/index.php\/wp-json\/wp\/v2\/posts\/192"}],"collection":[{"href":"https:\/\/blog.inhowe.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.inhowe.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.inhowe.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.inhowe.com\/index.php\/wp-json\/wp\/v2\/comments?post=192"}],"version-history":[{"count":2,"href":"https:\/\/blog.inhowe.com\/index.php\/wp-json\/wp\/v2\/posts\/192\/revisions"}],"predecessor-version":[{"id":194,"href":"https:\/\/blog.inhowe.com\/index.php\/wp-json\/wp\/v2\/posts\/192\/revisions\/194"}],"wp:attachment":[{"href":"https:\/\/blog.inhowe.com\/index.php\/wp-json\/wp\/v2\/media?parent=192"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.inhowe.com\/index.php\/wp-json\/wp\/v2\/categories?post=192"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.inhowe.com\/index.php\/wp-json\/wp\/v2\/tags?post=192"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}