{"id":1360,"date":"2024-02-06T23:47:26","date_gmt":"2024-02-06T15:47:26","guid":{"rendered":"http:\/\/www.forillusion.com\/?p=1360"},"modified":"2025-02-14T11:39:10","modified_gmt":"2025-02-14T03:39:10","slug":"winter-algorithm-training1-data-structure-foundation","status":"publish","type":"post","link":"https:\/\/www.forillusion.com\/index.php\/winter-algorithm-training1-data-structure-foundation\/","title":{"rendered":"\u5bd2\u5047\u7b97\u6cd5\u8bad\u7ec3\uff08\u4e00\uff09\u6570\u636e\u7ed3\u6784\u57fa\u7840"},"content":{"rendered":"\n

<\/div><\/p>\n\n\n\n

#Algo0101. Look Up S<\/h2>\n\n\n\n

\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n

\u672c\u9898\u4e3a\u5355\u8c03\u6808\u6a21\u7248\u9898\u3002\u6bcf\u5934\u5976\u725b\u5411\u53f3\u770b\uff0c\u6c42\u51fa\u6bcf\u53ea\u5976\u725b\u79bb\u5979\u6700\u8fd1\u7684\u4ef0\u671b\u5bf9\u8c61\uff0c\u4e5f\u5c31\u662f\u6c42\u51fa\u53f3\u8fb9\u7b2c\u4e00\u4e2a\u5927\u4e8e\u81ea\u5df1\u7684\u6570\u3002\u4ece\u53f3\u5f80\u5de6\u7ef4\u62a4\u4e00\u4e2a\u4e25\u683c\u5355\u589e\u7684\u5355\u8c03\u6808\u5373\u53ef\u3002<\/p>\n\n\n\n

int n,a[1000006],b[1000006];\nstack<pair<int,int>> q;\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n;\n    CII(a,1,n);\n    FD(i,n,1)\n    {\n        while (!q.empty()&&a[i]>=q.top().first)\n            q.pop();\n        if (q.empty()) b[i]=0;\n        else b[i]=q.top().second;\n        q.push(make_pair(a[i],i));\n    }\n    F(i,1,n)\n        CO b[i] L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#Algo0102. Bad Hair Day S<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u672c\u9898\u6c42\u80fd\u770b\u89c1\u591a\u5c11\u4e2a\u725b\u7684\u5934\u53d1\uff0c\u5373\u5f53\u725b\u5411\u53f3\u770b\u65f6\uff0c\u6709\u591a\u5c11\u5934\u725b\u7684\u8eab\u9ad8\u662f\u5c0f\u4e8e\u81ea\u5df1\u7684\uff0c\u76f4\u5230\u9047\u5230\u5347\u9ad8\u5927\u4e8e\u81ea\u5df1\u7684\u725b\u3002\u53ef\u4ee5\u8f6c\u6362\u4ee5\u4e0b\u601d\u8def\uff0c\u5c06\u770b\u89c1\u591a\u5c11\u5934\u725b\u8f6c\u6362\u4e3a\u88ab\u591a\u5c11\u5934\u725b\u770b\u89c1\u81ea\u5df1\u7684\u5934\u53d1\u3002\u80fd\u770b\u89c1\u81ea\u5df1\u5934\u53d1\u7684\u725b\uff0c\u5fc5\u7136\u662f\u5904\u4e8e\u5de6\u8fb9\u4e14\u9ad8\u4e8e\u81ea\u5df1\u7684\u725b\uff0c\u800c\u4e14\u4e2d\u95f4\u6ca1\u6709\u6bd4\u89c2\u5bdf\u8005\u66f4\u9ad8\u7684\u725b\u963b\u9694\u3002\u6240\u4ee5\u53ef\u4ee5\u4ece\u5de6\u5230\u53f3\u7ef4\u62a4\u4e00\u4e2a\u4e25\u683c\u5355\u51cf\u7684\u5355\u8c03\u6808\uff0c\u800c\u6bcf\u6b21\u7ef4\u62a4\u5b8c\u6808\u540e\uff0c\u6808\u4e2d\u7684\u5143\u7d20\u4e2a\u6570\u4fbf\u662f\u80fd\u770b\u5230\u81ea\u5df1\u7684\u725b\u7684\u4e2a\u6570\u3002\u4f46\u662f\u7531\u4e8eSTL\u5185\u7f6e\u7684\u6808\u5e76\u4e0d\u80fd\u67e5\u8be2\u6808\u5185\u5143\u7d20\u4e2a\u6570\uff0c\u6240\u4ee5\u53ef\u4ee5\u5728\u5165\u6808\u548c\u51fa\u6808\u65f6\u8fdb\u884c\u8ba1\u6570\uff0c\u4e5f\u53ef\u4ee5\u81ea\u5df1\u5199\u4e00\u5957\u6808\u7684\u51fd\u6570\u3002<\/p>\n\n\n\n
LL n,a[80004],ans;\nstruct myStack\n{\n    int a[80004],index=0;\n    int empty()\n    {\n        return index==0;\n    }\n    int top()\n    {\n        return a[index];\n    }\n    void push(int x)\n    {\n        a[++index]=x;\n    }\n    void pop()\n    {\n        index--;\n    }\n    int ind()\n    {\n        return index;\n    }\n} q;\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n;\n    CII(a,1,n);\n    F(i,1,n)\n    {\n        while (!q.empty()&&a[i]>=q.top())\n            q.pop();\n        if (!q.empty()) ans+=q.ind();\n        q.push(a[i]);\n    }\n    CO ans L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#Algo0103. \u7389\u87fe\u5bab<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u672c\u9898\u9700\u8981\u6c42\u7531F\u6784\u6210\u7684\u6700\u5927\u7684\u77e9\u5f62\u9762\u79ef\u3002\u5728\u6c42\u6700\u5927\u77e9\u5f62\u9762\u79ef\u65f6\uff0c\u53ef\u4ee5\u5229\u7528\u5355\u8c03\u6808\u6765\u5feb\u901f\u627e\u5230\u6700\u5927\u7684\u9762\u79ef\u3002\u5148\u9009\u4e2d\u4e00\u884c\uff0c\u5c06\u6bcf\u4e00\u5217\u89c6\u4e3a\u4e00\u4e2a\u77e9\u5f62\uff0c\u5e76\u6c42\u51fa\u8be5\u884c\u4e2d\u6bcf\u4e00\u5217\u7684F\u5411\u4e0a\u6700\u5927\u80fd\u5ef6\u4f38\u7684\u9ad8\u5ea6\u4e3a\u591a\u5c11\uff0c\u5c06\u5176\u5b9a\u4e3a\u6bcf\u4e00\u5217\u7684\u9ad8\u5ea6\u3002\u8fd9\u6837\u5c31\u5c06\u4e8c\u7ef4\u4e2d\u5bfb\u627e\u6700\u5927\u77e9\u5f62\u9762\u79ef\u8f6c\u6362\u4e3a\u4e86\u7ed9\u5b9a\u6bcf\u4e2a\u77e9\u5f62\u7684\u9ad8\u5ea6\uff0c\u5728\u5176\u4e2d\u5bfb\u627e\u6700\u5927\u77e9\u5f62\u9762\u79ef\u3002\u7136\u540e\u5bf9\u6bcf\u4e00\u884c\u5e94\u7528\u4e00\u6b21\u8fd9\u6837\u7684\u8ba1\u7b97\uff0c\u4fbf\u80fd\u5f97\u5230\u6700\u7ec8\u6700\u5927\u7684\u77e9\u5f62\u9762\u79ef\u3002\u5bf9\u4e8e\u7ed9\u5b9a\u6bcf\u4e2a\u77e9\u5f62\u9ad8\u5ea6\u6c42\u5176\u4e2d\u7684\u6700\u5927\u9762\u79ef\uff0c\u9996\u5148\u9700\u8981\u9009\u4e2d\u4e00\u4e2a\u77e9\u5f62\u9ad8\u5ea6\uff0c\u5e76\u7531\u8be5\u9ad8\u5ea6\u6784\u6210\u5927\u77e9\u5f62\uff0c\u8fd9\u65f6\u8fd8\u9700\u8981\u6c42\u51fa\u8be5\u9ad8\u5ea6\u80fd\u591f\u5f97\u5230\u7684\u6700\u5927\u5bbd\u5ea6\u4e3a\u591a\u5c11\u3002\u6700\u5927\u5bbd\u5ea6\u662f\u6839\u636e\u88ab\u9009\u5b9a\u77e9\u5f62\u7684\u5de6\u53f3\u4e24\u8fb9\u6709\u591a\u5c11\u4e2a\u9ad8\u5ea6\u5927\u4e8e\u5b83\u7684\u77e9\u5f62\uff0c\u4e5f\u5c31\u662f\u9700\u8981\u5206\u522b\u627e\u5230\u5de6\u53f3\u7b2c\u4e00\u4e2a\u5c0f\u4e8e\u5b83\u7684\u9ad8\u5ea6\u7684\u77e9\u5f62\u3002\u8fd9\u5c31\u5c06\u95ee\u9898\u53c8\u8f6c\u53d8\u4e3a\u4e86\u5355\u8c03\u6808\u95ee\u9898\u3002\u53ef\u4ee5\u5229\u7528\u5355\u8c03\u6808\u5206\u522b\u627e\u5230\u5de6\u53f3\u7b2c\u4e00\u4e2a\u9ad8\u5ea6\u5c0f\u4e8e\u88ab\u9009\u5b9a\u77e9\u5f62\u7684\u4f4d\u7f6e\uff0c\u76f8\u51cf\u5c31\u80fd\u5f97\u5230\u5927\u77e9\u5f62\u7684\u5bbd\uff0c\u7136\u540e\u4e0e\u9ad8\u76f8\u4e58\u5f97\u5230\u9762\u79ef\u3002<\/p>\n\n\n\n
int n,m,a[1003][1003],b[1003],l[1003],r[1003],ans;\nchar c;\n\nvoid findRMin(int n,int a[],int b[])   \/\/\u5355\u8c03\u6808\u5bfb\u627e\u53f3\u8fb9\u7b2c\u4e00\u4e2a\u6bd4\u81ea\u5df1\u5c0f\u7684\u5143\u7d20\u7684\u5750\u6807\n{\n    stack<pair<int,int>> q;\n    FD(i,n,1)\n    {\n        while (!q.empty()&&a[i]<=q.top().first)\n            q.pop();\n        if (q.empty()) b[i]=n+1;\n        else b[i]=q.top().second;\n        q.push(make_pair(a[i],i));\n    }\n}\n\nvoid findLMin(int n,int a[],int b[])   \/\/\u5355\u8c03\u6808\u5bfb\u627e\u5de6\u8fb9\u7b2c\u4e00\u4e2a\u6bd4\u81ea\u5df1\u5c0f\u7684\u5143\u7d20\u7684\u5750\u6807\n{\n    stack<pair<int,int>> q;\n    F(i,1,n)\n    {\n        while (!q.empty()&&a[i]<=q.top().first)\n            q.pop();\n        if (q.empty()) b[i]=0;\n        else b[i]=q.top().second;\n        q.push(make_pair(a[i],i));\n    }\n}\n\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n>>m;\n    F(i,1,n)\n        F(j,1,m)\n        {\n            CI c;\n            a[i][j]=c=='R'?0:1;\n        }\n    \n    \n    F(i,1,n)\n   \/\/\u5bf9\u6bcf\u4e00\u884c\u90fd\u8fdb\u884c\u4e00\u6b21\u8fd0\u7b97\n    {\n        F(j,1,m)\n  \/\/\u5148\u6c42\u51fa\u6bcf\u5217\u5411\u4e0a\u6700\u5927\u7684\u5ef6\u4f38\u9ad8\u5ea6\n        {\n            b[j]=0;\n            FD(k,i,1)\n                if (a[k][j]) b[j]++;\n                else break;\n        }\n        findLMin(m,b,l);\n   \/\/\u6c42\u51fa\u6bcf\u4e00\u5217\u5de6\u4fa7\u7b2c\u4e00\u4e2a\u5c0f\u4e8e\u81ea\u5df1\u9ad8\u5ea6\u7684\u5217\n        findRMin(m,b,r);\n   \/\/\u6c42\u51fa\u6bcf\u4e00\u5217\u53f3\u4fa7\u7b2c\u4e00\u4e2a\u5c0f\u4e8e\u81ea\u5df1\u9ad8\u5ea6\u7684\u5217\n        F(j,1,m)\n   \/\/\u5bf9\u6bcf\u4e00\u5217\u5206\u522b\u8ba1\u7b97\u77e9\u5f62\u9762\u79ef\n        {\n            ans=max(ans,b[j]*(r[j]-l[j]-1));\n        }\n    }\n\n    CO ans*3 L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#Algo0104. \u6ed1\u52a8\u7a97\u53e3<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u8be5\u9898\u4e3a\u5355\u8c03\u961f\u5217\u7684\u6a21\u7248\u9898\u3002\u6700\u5927\u503c\u548c\u6700\u5c0f\u503c\u9700\u8981\u5206\u522b\u6c42\u89e3\u3002\u9996\u5148\u9700\u8981\u4e24\u4e2a\u6307\u9488\u5206\u522b\u6307\u5411\u961f\u5217\u7684\u5f00\u5934\u548c\u7ed3\u5c3e\u3002\u4ece\u5de6\u5230\u53f3\u4f9d\u6b21\u904d\u5386\u6bcf\u4e00\u4e2a\u5143\u7d20\uff0c\u5728\u6c42\u7a97\u53e3\u6700\u5c0f\u503c\u65f6\uff0c\u9700\u8981\u4ece\u961f\u5217\u672b\u5c3e\u4e2d\u5c06\u5927\u4e8e\u5f53\u524d\u5143\u7d20\u7684\u5143\u7d20\u90fd\u79fb\u9664\u961f\u5217\uff0c\u56e0\u4e3a\u6bcf\u6b21\u904d\u5386\u65f6\uff0c\u90fd\u610f\u5473\u7740\u5f53\u524d\u5143\u7d20\u88ab\u52a0\u5165\u5230\u7a97\u53e3\u4e2d\uff0c\u540c\u65f6\u4e5f\u610f\u5473\u7740\u961f\u5217\u4e2d\u90a3\u4e9b\u5927\u4e8e\u5f53\u524d\u5143\u7d20\u7684\u5143\u7d20\u90fd\u518d\u4e5f\u4e0d\u53ef\u80fd\u6210\u4e3a\u6700\u5c0f\u503c\uff0c\u6240\u4ee5\u5c06\u5176\u79fb\u51fa\u961f\u5217\u3002\u540c\u65f6\u6bcf\u6b21\u90fd\u8981\u5224\u65ad\u4e00\u6b21\u961f\u5217\u5934\u90e8\u662f\u5426\u5df2\u7ecf\u8d85\u51fa\u4e86\u7a97\u53e3\u4e86\uff0c\u5e76\u79fb\u9664\u8d85\u51fa\u7684\u5143\u7d20\u3002\u540c\u65f6\u7531\u4e8e\u961f\u5217\u91cc\u7684\u5143\u7d20\u4e25\u683c\u5355\u8c03\u9012\u589e\uff0c\u6240\u4ee5\u961f\u5217\u5934\u90e8\u5373\u4e3a\u5f53\u524d\u7a97\u53e3\u7684\u6700\u5c0f\u503c\u3002<\/p>\n\n\n\n
int n,k,f,h;\nLL a[1000006],p[1000006];\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n>>k;\n    CII(a,1,n)\n\n    f=1,h=0;\n    F(i,1,n)\n    {\n        while (f<=h&&a[p[h]]>=a[i])\n            h--;\n        p[++h]=i;\n        if (p[f]<i-k+1) f++;\n        if (i>=k) CO a[p[f]] P;\n    }\n    CL\n\n    f=1,h=0;\n    F(i,1,n)\n    {\n        while (f<=h&&a[p[h]]<=a[i])\n            h--;\n        p[++h]=i;\n        if (p[f]<i-k+1) f++;\n        if (i>=k) CO a[p[f]] P;\n    }\n    CL\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#Algo0105. \u5408\u5e76\u679c\u5b50<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u4e3a\u4e86\u4ee5\u6700\u5c11\u4f53\u529b\u5408\u5e76\u679c\u5b50\uff0c\u9700\u8981\u6bcf\u6b21\u90fd\u627e\u51fa\u91cd\u91cf\u6700\u5c0f\u7684\u4e24\u5806\u679c\u5b50\u8fdb\u884c\u5408\u5e76\uff0c\u7136\u540e\u518d\u5c06\u5408\u5e76\u540e\u7684\u91cd\u91cf\u52a0\u56de\u679c\u5b50\u961f\u5217\uff0c\u7136\u540e\u8fdb\u884c\u4e0b\u4e00\u6b21\u627e\u51fa\u91cd\u91cf\u6700\u5c0f\u7684\u4e24\u5806\u679c\u5b50\u3002\u5bf9\u4e8e\u8fd9\u79cd\u9700\u8981\u591a\u6b21\u5bfb\u627e\u6700\u5c0f\u503c\u7684\u64cd\u4f5c\uff0c\u53ef\u4ee5\u7528\u4f18\u5148\u961f\u5217\u7684\u5c0f\u6839\u5806\u6765\u505a\u3002\u4f18\u5148\u961f\u5217\u4f1a\u5728\u6bcf\u6b21\u52a0\u5165\u65b0\u5143\u7d20\u65f6\u81ea\u52a8\u8fdb\u884c\u6392\u5e8f\u4e14\u65f6\u95f4\u6548\u7387\u9ad8\u3002<\/p>\n\n\n\n
priority_queue<LL,vector<LL>,greater<LL>> q;\nLL n,a,ans;\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n;\n    F(i,1,n)\n    {\n        CI a;\n        q.push(a); \n    }\n    F(i,1,n-1)\n    {\n        LL a=q.top();\n        q.pop();\n        LL b=q.top();\n        q.pop();\n        ans+=a+b;\n        q.push(a+b);\n    }\n    CO ans L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#Algo0106. \u4e8e\u662f\u4ed6\u9519\u8bef\u7684\u70b9\u540d\u5f00\u59cb\u4e86<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u672c\u9898\u9700\u8981\u67e5\u627e\u6240\u7ed9\u5b57\u7b26\u4e32\u662f\u5426\u5b58\u5728\uff0c\u540c\u65f6\u7edf\u8ba1\u4e00\u4e2a\u5b57\u7b26\u4e32\u88ab\u67e5\u627e\u7684\u6b21\u6570\u3002\u5bf9\u4e8e\u8fd9\u79cd\u5927\u6279\u91cf\u67e5\u627e\u5b57\u7b26\u4e32\u7684\u64cd\u4f5c\uff0c\u5982\u679c\u4f7f\u7528\u7b80\u5355\u7684\u5bf9\u6bd4\uff0c\u5219\u4f1a\u5b58\u5728\u5927\u91cf\u4e0d\u5fc5\u8981\u7684\u5bf9\u6bd4\u3002\u6240\u4ee5\u9700\u8981\u4f7f\u7528\u5b57\u5178\u6811\u6765\u5feb\u901f\u67e5\u627e\u5b57\u7b26\u4e32\u3002\u7531\u4e8e\u9898\u76ee\u9700\u8981\u7edf\u8ba1\u4e00\u4e2a\u5b57\u7b26\u4e32\u88ab\u67e5\u627e\u7684\u6b21\u6570\u6765\u5224\u8bfb\u662f\u5426\u5b58\u5728\u91cd\u590d\u70b9\u540d\uff0c\u6240\u4ee5\u5bf9\u5b57\u5178\u6811\u7684\u8282\u70b9\u8fdb\u884c\u6539\u9020\uff0c\u4f7f\u5176\u5728\u8bb0\u5f55\u662f\u5426\u4e3a\u5355\u8bcd\u7ed3\u5c3e\u7684\u540c\u65f6\uff0c\u8bb0\u5f55\u8be5\u5355\u8bcd\u7ed3\u5c3e\u662f\u5426\u88ab\u67e5\u627e\u8fc7\u3002\u5f53\u8be5\u5355\u8bcd\u7ed3\u5c3e\u88ab\u67e5\u627e\u65f6\uff0c\u8fdb\u884c\u6807\u8bb0\u6216\u8fd4\u56de\u88ab\u91cd\u590d\u67e5\u627e\u7684\u4fe1\u606f\u3002<\/p>\n\n\n\n
int n;\nstring s;\n\nstruct trie\n{\n    int next[26]; \n    int isEnd;\n    int call; \n   \/\/\u8bb0\u5f55\u8be5\u5355\u8bcd\u7ed3\u5c3e\u662f\u5426\u88ab\u67e5\u627e\u8fc7\n}tree[500005];\nint inc;\n\nint insert(string s)  \n{\n    int p=0;   \n    for (int i=0;i<s.size();i++)   \n    {\n        if (tree[p].next[s[i]-97]) p=tree[p].next[s[i]-97];\n        else  \n        {\n            inc++;  \n            tree[p].next[s[i]-97]=inc;  \n            p=inc;   \n        }\n    }\n    if (tree[p].isEnd) return 1;   \n    else tree[p].isEnd=1;  \n    return 0;\n}\n\nint check(string s)   \n{\n    int p=0;   \n    for (int i=0;i<s.size();i++)   \n    {\n        if (!tree[p].next[s[i]-97]) return 0;   \n        p=tree[p].next[s[i]-97];  \n    }\n    if (tree[p].call) return -1;\n   \/\/\u9996\u5148\u9700\u8981\u5224\u65ad\u8be5\u5355\u8bcd\u662f\u5426\u88ab\u67e5\u627e\u8fc7\uff0c\u5982\u679c\u88ab\u67e5\u627e\u8fc7\uff0c\u5219\u8bf4\u660e\u8be5\u5355\u8bcd\u5b58\u5728\u3002\n    if (!tree[p].isEnd) return 0;\n   \/\/\u5728\u6ca1\u88ab\u67e5\u627e\u8fc7\u7684\u57fa\u7840\u4e0a\uff0c\u518d\u5224\u65ad\u8be5\u5355\u8bcd\u662f\u5426\u5b58\u5728\n    tree[p].call=1;\n   \/\/\u6807\u8bb0\u8be5\u5355\u8bcd\u88ab\u67e5\u627e\u8fc7\uff0c\u5e76\u8fd4\u56de\u5355\u8bcd\u5b58\u5728\n    return 1;\n}\n\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n;\n    F(i,1,n)\n    {\n        CI s;\n        insert(s);\n    }\n\n    CI n;\n    F(i,1,n)\n    {\n        CI s;\n        switch (check(s))\n        {\n            case 1: CO \"OK\" L; break;\n            case 0: CO \"WRONG\" L; break;\n            case -1: CO \"REPEAT\" L; break;\n        }\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#Algo0107. Minimum Array<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u5bf9\u7ed9\u5b9a\u7684b\u6570\u7ec4\u8fdb\u884c\u6392\u5e8f\uff0c\u4f7f\u5f97\u6570\u7ec4c\uff1a[latex](a_i+b_i)%n[\/latex]\u7684\u5b57\u5178\u5e8f\u6700\u5c0f\u3002\u4f7f\u5b57\u5178\u5e8f\u6700\u5c0f\uff0c\u5373\u5c3d\u91cf\u8ba90\u9760\u524d\uff0c\u4e5f\u5c31\u662f[latex]b_i=n-a_i[\/latex]\uff0c\u7136\u540e\u662f\u6570\u5b57\u5c0f\u7684\u9760\u524d\u3002\u6240\u4ee5\u53ef\u4ee5\u4f7f\u7528\u53ef\u91cd\u590d\u7684\u96c6\u5408multiset\u8fdb\u884c\u64cd\u4f5c\u3002<\/p>\n\n\n\n
int n,a[200005],ans,x;\nmultiset<int> s;\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n;\n    CII(a,1,n)\n    F(i,1,n)\n    {\n        CI x;\n        s.insert(x);\n    }\n\n    F(i,1,n)\n    {\n        auto it=s.lower_bound(n-a[i]);\n   \/\/\u5bfb\u627en-a[i]\u5e76\u5224\u65ad\u662f\u5426\u5b58\u5728\n        if (it==s.end()) it=s.begin();\n   \/\/\u5982\u679c\u4e0d\u5b58\u5728\uff0c\u5219\u9009\u62e9\u96c6\u5408\u4e2d\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\uff0c\u5373\u6700\u5c0f\u7684\u5143\u7d20\n        CO (*it+a[i])%n P;\n        s.erase(it);\n    }\n    CL\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#Algo0108. \u56e2\u4f19<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u672c\u9898\u7684\u4e3b\u8981\u64cd\u4f5c\u4e3a\u5408\u5e76\u96c6\u5408\u4ee5\u53ca\u5224\u65ad\u4e24\u4e2a\u5143\u7d20\u662f\u5426\u5728\u540c\u4e00\u96c6\u5408\u4e2d\uff0c\u4f7f\u7528\u5e76\u67e5\u96c6\u5373\u53ef\u3002\u672c\u9898\u4e2d\u201c\u670b\u53cb\u7684\u670b\u53cb\u662f\u670b\u53cb\u201d\uff0c\u5c06\u4e24\u4e2a\u4e3a\u670b\u53cb\u7684\u5143\u7d20\u6240\u5728\u96c6\u5408\u8fdb\u884c\u5408\u5e76\u5373\u53ef\u3002\u4f46\u662f\u5bf9\u4e8e\u201c\u654c\u4eba\u7684\u654c\u4eba\u662f\u654c\u4eba\u201d\uff0c\u65e0\u6cd5\u8fdb\u884c\u76f4\u63a5\u7684\u5408\u5e76\u3002\u5047\u8bbe\u4e00\u4e2a\u4eba\u7684\u7f16\u53f7\u4e3aa\uff0c\u603b\u5171n\u4e2a\u4eba\uff0c\u5219\u53ef\u4ee5\u4f7f\u7528a+n\u6765\u8868\u793a\u8ddf\u8fd9\u4e2a\u4eba\u662f\u654c\u4eba\u5173\u7cfb\u3002\u4e0e\u8fd9\u4e2a\u4eba\u662f\u654c\u4eba\u65f6\uff0c\u5c06\u7b2ca+n\u4e2a\u5143\u7d20\u6240\u5728\u96c6\u5408\u5408\u5e76\u5230\u81ea\u5df1\u7684\u96c6\u5408\u5c31\u53ef\u4ee5\u8868\u793a\u654c\u4eba\u5173\u7cfb\u4e86\uff0c\u8fd9\u65f6\u4e0ea\u4e3a\u654c\u4eba\u5173\u7cfb\u7684\u4eba\u81ea\u7136\u90fd\u5904\u5728\u4e86\u540c\u4e00\u4e2a\u96c6\u5408\u3002<\/p>\n\n\n\n
int n,m,x,y,ans;\nchar c;\nint pre[200005];\n\nint find(int x)\n{\n    if (x!=pre[x]) pre[x]=find(pre[x]);\n    return pre[x];\n}\n\nvoid merge(int a,int b)\n{\n    int x=find(a);\n    int y=find(b);\n    pre[x]=y;\n}\n\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n>>m;\n    F(i,1,2*n)\n        pre[i]=i;\n\n    F(i,1,m)\n    {\n        CI c>>x>>y;\n        if (c=='E') \n        {\n            merge(x,y+n);\n            merge(x+n,y);\n        }\n        else merge(x,y);\n    }\n    F(i,1,n)\n        find(i);\n    sort(pre+1,pre+n+1);\n    F(i,1,n)\n        if (pre[i]!=pre[i-1]) ans++;\n    \n    CO ans L;\n    return 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
#Algo0101. Look Up S \u9898\u76ee\u63cf\u8ff0 \u672c\u9898\u4e3a\u5355\u8c03\u6808\u6a21\u7248\u9898\u3002\u6bcf\u5934\u5976\u725b\u5411\u53f3\u770b\uff0c\u6c42\u51fa\u6bcf\u53ea\u5976\u725b\u79bb\u5979\u6700\u8fd1\u7684\u4ef0\u671b\u5bf9\u8c61\uff0c\u4e5f\u5c31\u662f\u6c42\u51fa …<\/p>","protected":false},"author":1,"featured_media":1364,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,35],"tags":[12,34,22,39],"class_list":["post-1360","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-3","category-35","tag-12","tag-34","tag-22","tag-39"],"_links":{"self":[{"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts\/1360","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/comments?post=1360"}],"version-history":[{"count":1,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts\/1360\/revisions"}],"predecessor-version":[{"id":1731,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts\/1360\/revisions\/1731"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/media\/1364"}],"wp:attachment":[{"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/media?parent=1360"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/categories?post=1360"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/tags?post=1360"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}