{"id":203,"date":"2024-03-21T13:37:12","date_gmt":"2024-03-21T05:37:12","guid":{"rendered":"https:\/\/www.nenuacm.top\/?p=203"},"modified":"2024-03-21T18:19:13","modified_gmt":"2024-03-21T10:19:13","slug":"%e7%94%b1st%e8%a1%a8%e6%b1%82%e5%8c%ba%e9%97%b4%e6%9c%80%e5%a4%a7%e5%80%bc%e5%bc%95%e5%8f%91%e7%9a%84%e6%83%a8%e6%a1%88","status":"publish","type":"post","link":"https:\/\/www.nenuacm.top\/index.php\/2024\/03\/21\/%e7%94%b1st%e8%a1%a8%e6%b1%82%e5%8c%ba%e9%97%b4%e6%9c%80%e5%a4%a7%e5%80%bc%e5%bc%95%e5%8f%91%e7%9a%84%e6%83%a8%e6%a1%88\/","title":{"rendered":"\u7531ST\u8868\u6c42\u533a\u95f4\u6700\u5927\u503c\u5f15\u53d1\u7684\u60e8\u6848"},"content":{"rendered":"\n

P3865 \u3010\u6a21\u677f\u3011ST \u8868 – \u6d1b\u8c37 | \u8ba1\u7b97\u673a\u79d1\u5b66\u6559\u80b2\u65b0\u751f\u6001 (luogu.com.cn)<\/a><\/h2>\n\n\n\n
\n

\u3010\u6a21\u677f\u3011ST \u8868<\/h1>\n\n\n\n

\u9898\u76ee\u80cc\u666f<\/h2>\n\n\n\n

\u8fd9\u662f\u4e00\u9053 ST \u8868\u7ecf\u5178\u9898\u2014\u2014\u9759\u6001\u533a\u95f4\u6700\u5927\u503c<\/p>\n\n\n\n

\u8bf7\u6ce8\u610f\u6700\u5927\u6570\u636e\u65f6\u9650\u53ea\u6709 0.8s\uff0c\u6570\u636e\u5f3a\u5ea6\u4e0d\u4f4e\uff0c\u8bf7\u52a1\u5fc5\u4fdd\u8bc1\u4f60\u7684\u6bcf\u6b21\u67e5\u8be2\u590d\u6742\u5ea6\u4e3a O(1)\u3002\u82e5\u4f7f\u7528\u66f4\u9ad8\u65f6\u95f4\u590d\u6742\u5ea6\u7b97\u6cd5\u4e0d\u4fdd\u8bc1\u80fd\u901a\u8fc7\u3002<\/strong><\/p>\n\n\n\n

\u5982\u679c\u60a8\u8ba4\u4e3a\u60a8\u7684\u4ee3\u7801\u65f6\u95f4\u590d\u6742\u5ea6\u6b63\u786e\u4f46\u662f TLE\uff0c\u53ef\u4ee5\u5c1d\u8bd5\u4f7f\u7528\u5feb\u901f\u8bfb\u5165\uff1a <\/p>\n\n\n\n

inline int read()\n{\n\tint x=0,f=1;char ch=getchar();\n\twhile (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}\n\twhile (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}\n\treturn x*f;\n}<\/code><\/pre>\n\n\n\n
\u51fd\u6570\u8fd4\u56de\u503c\u4e3a\u8bfb\u5165\u7684\u7b2c\u4e00\u4e2a\u6574\u6570\u3002<\/p>\n\n\n\n
\u5feb\u901f\u8bfb\u5165\u4f5c\u7528\u4ec5\u4e3a\u52a0\u5feb\u8bfb\u5165\uff0c\u5e76\u975e\u5f3a\u5236\u4f7f\u7528\u3002<\/strong><\/p>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n\n\n\n
\u7ed9\u5b9a\u4e00\u4e2a\u957f\u5ea6\u4e3a N \u7684\u6570\u5217\uff0c\u548c M \u6b21\u8be2\u95ee\uff0c\u6c42\u51fa\u6bcf\u4e00\u6b21\u8be2\u95ee\u7684\u533a\u95f4\u5185\u6570\u5b57\u7684\u6700\u5927\u503c\u3002<\/p>\n\n\n\n
\u8f93\u5165\u683c\u5f0f<\/h2>\n\n\n\n
\u7b2c\u4e00\u884c\u5305\u542b\u4e24\u4e2a\u6574\u6570 N,M\uff0c\u5206\u522b\u8868\u793a\u6570\u5217\u7684\u957f\u5ea6\u548c\u8be2\u95ee\u7684\u4e2a\u6570\u3002<\/p>\n\n\n\n
\u7b2c\u4e8c\u884c\u5305\u542b N \u4e2a\u6574\u6570\uff08\u8bb0\u4e3a $a_i$\uff09\uff0c\u4f9d\u6b21\u8868\u793a\u6570\u5217\u7684\u7b2c $i$ \u9879\u3002<\/p>\n\n\n\n
\u63a5\u4e0b\u6765 M \u884c\uff0c\u6bcf\u884c\u5305\u542b\u4e24\u4e2a\u6574\u6570 $l_i,r_i$\uff0c\u8868\u793a\u67e5\u8be2\u7684\u533a\u95f4\u4e3a $[l_i,r_i]$\u3002<\/p>\n\n\n\n
\u8f93\u51fa\u683c\u5f0f<\/h2>\n\n\n\n
\u8f93\u51fa\u5305\u542b M \u884c\uff0c\u6bcf\u884c\u4e00\u4e2a\u6574\u6570\uff0c\u4f9d\u6b21\u8868\u793a\u6bcf\u4e00\u6b21\u8be2\u95ee\u7684\u7ed3\u679c\u3002<\/p>\n\n\n\n
\u6837\u4f8b #1<\/h2>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 #1<\/h3>\n\n\n\n
 8 8
 9 3 1 7 5 6 0 8
 1 6
 1 5
 2 7
 2 6
 1 8
 4 8
 3 7
 1 8<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa #1<\/h3>\n\n\n\n
 9
 9
 7
 7
 9
 8
 7
 9<\/p>\n\n\n\n
\u63d0\u793a<\/h2>\n\n\n\n
\u5bf9\u4e8e $30\\%$ \u7684\u6570\u636e\uff0c\u6ee1\u8db3 $1\\le N,M\\le 10$\u3002<\/p>\n\n\n\n
\u5bf9\u4e8e $70\\%$ \u7684\u6570\u636e\uff0c\u6ee1\u8db3 $1\\le N,M\\le {10}^5$\u3002<\/p>\n\n\n\n
\u5bf9\u4e8e $100\\%$ \u7684\u6570\u636e\uff0c\u6ee1\u8db3 $1\\le N\\le {10}^5\uff0c1\\le M\\le 2\\times{10}^6\uff0ca_i\\in[0,{10}^9]\uff0c1\\le l_i\\le r_i\\le N$\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u5bf9\u4e8e\u8fd9\u9053\u9898\uff0c\u7b14\u8005\u4e0d\u89e3\u91ca\u5176\u505a\u6cd5\uff0c\u4f46\u662f\u6211\u4eec\u6765\u8bb2\u91cc\u9762\u5173\u4e8e\u540c\u6b65\u6d41\u548c\u5feb\u8bfb<\/mark>\u7684\u6545\u4e8b\u3002<\/p>\n\n\n\n
\/\/#include<bits\/stdc++.h>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<queue>\n#include<cmath>\nusing namespace std;\n\nint a[100005];\nint n;\n\nint dp[100005][30];\n\ninline int read(){\n\tchar ch;\n\tint x = 0;\n\tint f = 1;\n\tch = getchar();\n\twhile(!('0' <= ch && ch <= '9')){\n\t\tif(ch == '-') f = -1;\n\t\tch = getchar();\/\/\u4f7f\u7528getchar()\n\t}\n\twhile('0' <= ch && ch <= '9'){\n\t\tx = (x << 3) + (x << 1) + (ch - '0');\n\t\tch = getchar();\n\t}\n\treturn x * f;\n}\n\nint query(int l, int r){\n\tint k = log2(r - l + 1);\n\treturn max(dp[l][k], dp[r - (1 << k) + 1][k]);\n}\n\nint main(){\n\tios::sync_with_stdio(false), cin.tie(0);\/\/\u5173\u95ed\u540c\u6b65\u6d41\n\tint n, q;\n\tcin >> n >> q;\/\/\u4f7f\u7528cin\n\tfor(int i = 1; i <= n; i++){\n\t\ta[i] = read();\/\/\u4f7f\u7528\u5feb\u8bfb\n\t\tdp[i][0] = a[i];\n\t}\n\t\n\tfor(int j = 1; (1 << j) <= n; j++){\n\t\tfor(int i = 1; i + (1 << j) - 1 <= n; i++){\n\t\t\tdp[i][j] = max(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);\n\n\t\t}\n\t}\n\twhile(q--){\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tcout << query(l, r) << \"\\n\";\n\t}\n\t\n \treturn 0;\n }<\/code><\/pre>\n\n\n\n
\u8fd9\u4e00\u6bb5\u4ee3\u7801\u7684\u8fd0\u884c\u7ed3\u679c\u662fRE\u548cTLE\uff1a<\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u8fd9\u662f\u4e3a\u4ec0\u4e48\u5462\uff1f<\/p>\n\n\n\n
\u5176\u5b9e\u662f\u56e0\u4e3agetchar()<\/mark>\u662fc\u51fd\u6570\uff0c\u800c\u6211\u4eecios::sync_with_stdio(false), cin.tie(0);<\/mark>\u5c31\u662f\u4e3a\u4e86\u89e3\u7ed1\u8f93\u5165\u8f93\u51fa\uff0c\u5e76\u4e14\u4f7f\u672c\u8be5\u540c\u6b65\u7684\u8f93\u5165\u8f93\u51fa\u6d41\u5206\u5f00\uff0c\u5c31\u662f\u8ba9c\u98ce\u683c\u7684\u8f93\u5165\u8f93\u51fa\u6d41\u548cc++\u7684\u8f93\u5165\u8f93\u51fa\u6d41\u5206\u5f00\u3002<\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u6240\u4ee5\u5feb\u8bfb\u4e2d\u7684getchar\u548ccin\u6df7\u7528\u4f1a\u4ea7\u751f\u5f88\u795e\u5947\u7684\u95ee\u9898\u3002<\/strong><\/p>\n\n\n\n
\u6240\u4ee5\u6211\u4eec\u5982\u679c\u5173\u95ed\u540c\u6b65\u6d41\uff0c\u5c31\u8bf7\u53ea\u7528C++\u7684cin\u548ccin.get()\uff0c\u800c\u4e0d\u8981\u4f7f\u7528c\u8bed\u8a00\u7684scanf\u4ee5\u53cagetchar()\u3002<\/mark><\/strong><\/p>\n\n\n\n
\u6240\u4ee5\u8fd9\u9053\u9898\u6211\u4eec\u4e0b\u9762\u4e09\u79cd\u4ee3\u7801\u90fd\u662f\u53ef\u4ee5\u901a\u8fc7\u7684\u3002<\/p>\n\n\n\n
\u4e0d\u8fc7\u8fd9\u9053\u9898\u4e0d\u662f\u6211\u4eec\u7684\u6838\u5fc3\uff0c\u53ea\u662f\u6211\u4eec\u901a\u8fc7\u8fd9\u9053\u9898\u4f20\u9012\u4e0a\u9762\u8fd9\u4e2a\u601d\u60f3\u3002<\/em><\/p>\n\n\n\n
\u4ee3\u7801\u4e00\uff1a\u4e0d\u7528\u5feb\u8bfb\uff0c\u5173\u95ed\u540c\u6b65\u6d41<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int MAXN = 2e5 + 7;\n\nint dp[MAXN][30];\n\nvoid solve(){\n\tint n;\n\tcin >> n;\n\tint q;\n\tcin >> q;\n\tvector<int> a(n + 1);\n\tfor(int i = 1; i <= n; i++) cin >> a[i];\n\tfor(int i = 1; i <= n; i++) dp[i][0] = a[i];\n\tfor(int j = 1; j <= 30; j++){\n\t\tfor(int i = 1; i + (1 << j) - 1 <= n; i++){\n\t\t\tdp[i][j] = max(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);\n\t\t}\n\t}\t\n\t\n\twhile(q--){\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tint k = log2(r - l + 1);\n\t\tcout << max(dp[l][k], dp[r - (1 << k) + 1][k]) << \"\\n\";\n\t}\n}\nint main(){\n\tios::sync_with_stdio(false),cin.tie(0);\n\tint t = 1;\n\t\/\/ cin >> t;\n\twhile(t--) solve();\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801\u4e8c\uff1a\u4f7f\u7528\u5feb\u8bfb\uff0c\u4e0d\u5173\u95ed\u540c\u6b65\u6d41\uff0c\u4e0d\u4f7f\u7528cin<\/h3>\n\n\n\n
\/\/#include<bits\/stdc++.h>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<queue>\n#include<cmath>\nusing namespace std;\n\nint a[100005];\nint n;\n\nint dp[100005][30];\n\ninline int read(){\n\tchar ch;\n\tint x = 0;\n\tint f = 1;\n\tch = getchar();\n\twhile(!('0' <= ch && ch <= '9')){\n\t\tif(ch == '-') f = -1;\n\t\tch = getchar();\n\t}\n\twhile('0' <= ch && ch <= '9'){\n\t\tx = (x << 3) + (x << 1) + (ch - '0');\n\t\tch = getchar();\n\t}\n\treturn x * f;\n}\n\nint query(int l, int r){\n\tint k = log2(r - l + 1);\n\treturn max(dp[l][k], dp[r - (1 << k) + 1][k]);\n}\n\nint main(){\n\t\/\/ ios::sync_with_stdio(false), cin.tie(0);\n\tint n, q;\n\tn = read();\n\tq = read();\n\tfor(int i = 1; i <= n; i++){\n\t\ta[i] = read();\n\t\tdp[i][0] = a[i];\n\t}\n\t\n\tfor(int j = 1; (1 << j) <= n; j++){\n\t\tfor(int i = 1; i + (1 << j) - 1 <= n; i++){\n\t\t\tdp[i][j] = max(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);\n\n\t\t}\n\t}\n\twhile(q--){\n\t\tint l, r;\n\t\tl = read();\n\t\tr = read();\n\t\tcout << query(l, r) << \"\\n\";\n\t}\n\t\n \treturn 0;\n }<\/code><\/pre>\n\n\n\n
\u4ee3\u7801\u4e09\uff1a\u5173\u95ed\u540c\u6b65\u6d41\uff0c\u4f7f\u7528cin\uff0c\u4f46\u662f\u4e0d\u7528getchar()\u800c\u662f\u7528cin.get()<\/h3>\n\n\n\n
\/\/#include<bits\/stdc++.h>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<queue>\n#include<cmath>\nusing namespace std;\n\nint a[100005];\nint n;\n\nint dp[100005][30];\n\ninline int read(){\n\tchar ch;\n\tint x = 0;\n\tint f = 1;\n\tch = cin.get();\/\/\u4f7f\u7528cin.get()\n\twhile(!('0' <= ch && ch <= '9')){\n\t\tif(ch == '-') f = -1;\n\t\tch = cin.get();\/\/\u4f7f\u7528cin.get()\n\t}\n\twhile('0' <= ch && ch <= '9'){\n\t\tx = (x << 3) + (x << 1) + (ch - '0');\n\t\tch = cin.get();\/\/\u4f7f\u7528cin.get()\n\t}\n\treturn x * f;\n}\n\nint query(int l, int r){\n\tint k = log2(r - l + 1);\n\treturn max(dp[l][k], dp[r - (1 << k) + 1][k]);\n}\n\nint main(){\n\tios::sync_with_stdio(false), cin.tie(0);\/\/\u5173\u95ed\u540c\u6b65\u6d41\n\tint n, q;\n\tcin >> n >> q;\/\/\u4f7f\u7528cin\n\tfor(int i = 1; i <= n; i++){\n\t\ta[i] = read();\/\/\u4f7f\u7528\u5feb\u8bfb\n\t\tdp[i][0] = a[i];\n\t}\n\t\n\tfor(int j = 1; (1 << j) <= n; j++){\n\t\tfor(int i = 1; i + (1 << j) - 1 <= n; i++){\n\t\t\tdp[i][j] = max(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);\n\n\t\t}\n\t}\n\twhile(q--){\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tcout << query(l, r) << \"\\n\";\n\t}\n\t\n \treturn 0;\n }<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
P3865 \u3010\u6a21\u677f\u3011ST \u8868 – \u6d1b\u8c37 | \u8ba1\u7b97\u673a\u79d1\u5b66\u6559\u80b2\u65b0\u751f\u6001 (luogu.com.cn) \u5bf9 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[15,8],"tags":[],"class_list":["post-203","post","type-post","status-publish","format-standard","hentry","category-15","category-8"],"_links":{"self":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/203","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=203"}],"version-history":[{"count":8,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/203\/revisions"}],"predecessor-version":[{"id":234,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/203\/revisions\/234"}],"wp:attachment":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/media?parent=203"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/categories?post=203"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/tags?post=203"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}