{"id":93322,"date":"2026-08-12T12:33:53","date_gmt":"2026-08-12T04:33:53","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/93322.html"},"modified":"2026-08-12T12:33:53","modified_gmt":"2026-08-12T04:33:53","slug":"%e6%b4%9b%e8%b0%b7p2895%e3%80%81p8818-%e4%b8%a4%e9%a2%98%e7%9a%84%e9%a2%98%e8%a7%a3","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/93322.html","title":{"rendered":"\u6d1b\u8c37P2895\u3001P8818 \u4e24\u9898\u7684\u9898\u89e3"},"content":{"rendered":"

\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"<\/p>\n

25\u5206<\/h2>\n

\u5148\u770b\u6700\u7b80\u5355\u7684\u60c5\u51b5\u3002\u5c31\u662f\u5f53A\u3001B\u6570\u7ec4\u5747\u4e3a\u6b63\u6570\u7684\u65f6\u5019，\u76f4\u63a5\u8f93\u51faA\u7684\u6700\u5927\u503c\u548c\u6700\u5c0f\u503c\u7684\u4e58\u79ef\u3002<\/p>\n

#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span>
\nlong<\/span> long<\/span> n,<\/span>m,<\/span>q,<\/span>x[<\/span>1005<\/span>]<\/span>,<\/span>y[<\/span>1005<\/span>]<\/span>;<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span>
\n{<\/span>
\n cin>><\/span>n>><\/span>m>><\/span>q;<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>
\n {<\/span>
\n cin>><\/span>x[<\/span>i]<\/span>;<\/span>
\n }<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i<=<\/span>m;<\/span>i++<\/span>)<\/span>
\n {<\/span>
\n cin>><\/span>y[<\/span>i]<\/span>;<\/span>
\n }<\/span>
\n while<\/span>(<\/span>q—<\/span>)<\/span>
\n {<\/span>
\n long<\/span> long<\/span> l1,<\/span>r1,<\/span>l2,<\/span>r2;<\/span>
\n cin>><\/span>l1>><\/span>r1>><\/span>l2>><\/span>r2;<\/span>
\n long<\/span> long<\/span> maxn=<\/span>–<\/span>1e17<\/span>,<\/span>minn=<\/span>1e17<\/span>;<\/span>\/\/long long \u7c7b\u578b，\u4e0d\u80fd\u5f00-1e8\u548c1e8<\/span>
\n for<\/span>(<\/span>long<\/span> long<\/span> i=<\/span>l1;<\/span>i<=<\/span>r1;<\/span>i++<\/span>)<\/span> maxn=<\/span>max<\/span>(<\/span>maxn,<\/span>x[<\/span>i]<\/span>)<\/span>;<\/span>
\n for<\/span>(<\/span>long<\/span> long<\/span> i=<\/span>l2;<\/span>i<=<\/span>r2;<\/span>i++<\/span>)<\/span> minn=<\/span>min<\/span>(<\/span>minn,<\/span>y[<\/span>i]<\/span>)<\/span>;<\/span>
\n cout<<<\/span>maxn*<\/span>minn<<<\/span>endl;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

60\u5206<\/h2>\n

\u4e0d\u7b970\u3002
\n\u6709\u4ee5\u4e0b\u8fd9\u51e0\u79cd\u60c5\u51b5，\u5206\u522b\u5bf9\u5e94\u8981\u6c42\u7684\u6700\u503c\u662f\u4ec0\u4e48：
\n\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"
\n\u5341\u5206\u590d\u6742，\u4f46\u662f\u601d\u8def\u7b80\u5355，\u4e5f\u5f88\u7ec6\u8282，\u76f4\u63a5\u7ed9\u4ee3\u7801：<\/p>\n

#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span>
\nlong<\/span> long<\/span> n,<\/span>m,<\/span>q,<\/span>a[<\/span>1005<\/span>]<\/span>,<\/span>b[<\/span>1005<\/span>]<\/span>;<\/span>
\nlong<\/span> long<\/span> check<\/span>(<\/span>int<\/span> l1,<\/span>int<\/span> r1,<\/span>int<\/span> l2,<\/span>int<\/span> r2)<\/span>{<\/span>
\n int<\/span> typea0=<\/span>0<\/span>,<\/span>typeb0=<\/span>0<\/span>;<\/span>
\n int<\/span> typea=<\/span>0<\/span>,<\/span>typeb=<\/span>0<\/span>;<\/span>
\n long<\/span> long<\/span> maxaz=<\/span>0<\/span>,<\/span>minaz=<\/span>1e17<\/span>,<\/span>maxaf=<\/span>–<\/span>1e17<\/span>,<\/span>minaf=<\/span>0<\/span>;<\/span>
\n long<\/span> long<\/span> maxbz=<\/span>0<\/span>,<\/span>minbz=<\/span>1e17<\/span>,<\/span>maxbf=<\/span>–<\/span>1e17<\/span>,<\/span>minbf=<\/span>0<\/span>;<\/span>
\n long<\/span> long<\/span> ans=<\/span>0<\/span>;<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>l1;<\/span>i<=<\/span>r1;<\/span>i++<\/span>)<\/span>{<\/span>
\n if<\/span>(<\/span>a[<\/span>i]<\/span><<\/span>0<\/span>)<\/span>{<\/span>
\n maxaf=<\/span>max<\/span>(<\/span>maxaf,<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>
\n minaf=<\/span>min<\/span>(<\/span>minaf,<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>
\n }<\/span>else<\/span> if<\/span>(<\/span>a[<\/span>i]<\/span>><\/span>0<\/span>)<\/span>{<\/span>
\n maxaz=<\/span>max<\/span>(<\/span>maxaz,<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>
\n minaz=<\/span>min<\/span>(<\/span>minaz,<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>
\n }<\/span>else<\/span> typea0=<\/span>1<\/span>;<\/span>
\n if<\/span>(<\/span>typea==<\/span>3<\/span>)<\/span> continue<\/span>;<\/span>
\n if<\/span>(<\/span>a[<\/span>i]<\/span>><\/span>0<\/span>&&<\/span>typea==<\/span>2<\/span>)<\/span> typea=<\/span>3<\/span>;<\/span>
\n else<\/span> if<\/span>(<\/span>a[<\/span>i]<\/span>><\/span>0<\/span>&&<\/span>typea==<\/span>0<\/span>)<\/span> typea=<\/span>1<\/span>;<\/span>
\n else<\/span> if<\/span>(<\/span>a[<\/span>i]<\/span><<\/span>0<\/span>&&<\/span>typea==<\/span>0<\/span>)<\/span> typea=<\/span>2<\/span>;<\/span>
\n else<\/span> if<\/span>(<\/span>a[<\/span>i]<\/span><<\/span>0<\/span>&&<\/span>typea==<\/span>1<\/span>)<\/span> typea=<\/span>3<\/span>;<\/span>
\n }<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>l2;<\/span>i<=<\/span>r2;<\/span>i++<\/span>)<\/span>{<\/span>
\n if<\/span>(<\/span>b[<\/span>i]<\/span><<\/span>0<\/span>)<\/span>{<\/span>
\n maxbf=<\/span>max<\/span>(<\/span>maxbf,<\/span>b[<\/span>i]<\/span>)<\/span>;<\/span>
\n minbf=<\/span>min<\/span>(<\/span>minbf,<\/span>b[<\/span>i]<\/span>)<\/span>;<\/span>
\n }<\/span>else<\/span> if<\/span>(<\/span>b[<\/span>i]<\/span>><\/span>0<\/span>)<\/span>{<\/span>
\n maxbz=<\/span>max<\/span>(<\/span>maxbz,<\/span>b[<\/span>i]<\/span>)<\/span>;<\/span>
\n minbz=<\/span>min<\/span>(<\/span>minbz,<\/span>b[<\/span>i]<\/span>)<\/span>;<\/span>
\n }<\/span>else<\/span> typeb0=<\/span>1<\/span>;<\/span>
\n if<\/span>(<\/span>typeb==<\/span>3<\/span>)<\/span> continue<\/span>;<\/span>
\n if<\/span>(<\/span>b[<\/span>i]<\/span>><\/span>0<\/span>&&<\/span>typeb==<\/span>2<\/span>)<\/span> typeb=<\/span>3<\/span>;<\/span>
\n else<\/span> if<\/span>(<\/span>b[<\/span>i]<\/span>><\/span>0<\/span>&&<\/span>typeb==<\/span>0<\/span>)<\/span> typeb=<\/span>1<\/span>;<\/span>
\n else<\/span> if<\/span>(<\/span>b[<\/span>i]<\/span><<\/span>0<\/span>&&<\/span>typeb==<\/span>0<\/span>)<\/span> typeb=<\/span>2<\/span>;<\/span>
\n else<\/span> if<\/span>(<\/span>b[<\/span>i]<\/span><<\/span>0<\/span>&&<\/span>typeb==<\/span>1<\/span>)<\/span> typeb=<\/span>3<\/span>;<\/span>
\n }<\/span>
\n if<\/span>(<\/span>typea==<\/span>1<\/span>)<\/span>{<\/span>
\n if<\/span>(<\/span>typeb==<\/span>1<\/span>)<\/span> ans=<\/span>maxaz*<\/span>minbz;<\/span>
\n else<\/span> if<\/span>(<\/span>typeb==<\/span>2<\/span>)<\/span> ans=<\/span>minaz*<\/span>minbf;<\/span>
\n else<\/span> ans=<\/span>minaz*<\/span>minbf;<\/span>
\n }<\/span>else<\/span> if<\/span>(<\/span>typea==<\/span>2<\/span>)<\/span>{<\/span>
\n if<\/span>(<\/span>typeb==<\/span>1<\/span>)<\/span> ans=<\/span>maxaf*<\/span>maxbz;<\/span>
\n else<\/span> if<\/span>(<\/span>typeb==<\/span>2<\/span>)<\/span> ans=<\/span>minaf*<\/span>maxbf;<\/span>
\n else<\/span> ans=<\/span>maxaf*<\/span>maxbz;<\/span>
\n }<\/span>else<\/span>{<\/span>
\n if<\/span>(<\/span>typeb==<\/span>1<\/span>)<\/span> ans=<\/span>maxaz*<\/span>minbz;<\/span>
\n else<\/span> if<\/span>(<\/span>typeb==<\/span>2<\/span>)<\/span> ans=<\/span>minaf*<\/span>maxbf;<\/span>
\n else<\/span> ans=<\/span>max<\/span>(<\/span>minaz*<\/span>minbf,<\/span>maxaf*<\/span>maxbz)<\/span>;<\/span>
\n }<\/span>
\n if<\/span>(<\/span>typea0)<\/span> ans=<\/span>max<\/span>(<\/span>ans,<\/span>0ll<\/span>)<\/span>;<\/span>
\n if<\/span>(<\/span>typeb0)<\/span> ans=<\/span>min<\/span>(<\/span>ans,<\/span>0ll<\/span>)<\/span>;<\/span>
\n return<\/span> ans;<\/span>
\n}<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span>
\n{<\/span>
\n cin>><\/span>n>><\/span>m>><\/span>q;<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span> cin>><\/span>a[<\/span>i]<\/span>;<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i<=<\/span>m;<\/span>i++<\/span>)<\/span> cin>><\/span>b[<\/span>i]<\/span>;<\/span>
\n while<\/span>(<\/span>q—<\/span>)<\/span>{<\/span>
\n int<\/span> l1,<\/span>r1,<\/span>l2,<\/span>r2;<\/span>
\n cin>><\/span>l1>><\/span>r1>><\/span>l2>><\/span>r2;<\/span>
\n cout<<<\/span>check<\/span>(<\/span>l1,<\/span>r1,<\/span>l2,<\/span>r2)<\/span><<<\/span>endl;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

100\u5206<\/h2>\n

\u524d\u9762\u662f\u7528\u5faa\u73af\u53bb\u627e\u533a\u95f4\u7684\u6781\u503c\u7684，\u8fd9\u91cc\u6539\u7528st\u8868\u3002<\/p>\n

#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span>
\nusing<\/span> ll=<\/span>long<\/span> long<\/span>;<\/span>
\nconst<\/span> int<\/span> MAXN=<\/span>1e5<\/span>+<\/span>5<\/span>;<\/span>
\nconst<\/span> int<\/span> LOG=<\/span>17<\/span>;<\/span>\/\/17\u7ea6=log1e5<\/span>
\nconst<\/span> ll INF=<\/span>1e17<\/span>;<\/span>
\nint<\/span> n,<\/span>m,<\/span>q,<\/span>a[<\/span>100005<\/span>]<\/span>,<\/span>b[<\/span>100005<\/span>]<\/span>;<\/span>
\nll lg2[<\/span>MAXN]<\/span>;<\/span>
\nll stazmax[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>;<\/span>
\nll stazmin[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>;<\/span>
\nll stafmax[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>;<\/span>
\nll stafmin[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>;<\/span>
\nll stbzmax[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>;<\/span>
\nll stbzmin[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>;<\/span>
\nll stbfmax[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>;<\/span>
\nll stbfmin[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>;<\/span>
\nll pa[<\/span>MAXN]<\/span>;<\/span>
\nll pb[<\/span>MAXN]<\/span>;<\/span>
\nvoid<\/span> initlog<\/span>(<\/span>int<\/span> n)<\/span>\/\/\u9884\u5904\u7406lg2<\/span>
\n{<\/span>
\n lg2[<\/span>1<\/span>]<\/span>=<\/span>0<\/span>;<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>2<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>
\n {<\/span>
\n lg2[<\/span>i]<\/span>=<\/span>lg2[<\/span>i\/<\/span>2<\/span>]<\/span>+<\/span>1<\/span>;<\/span>
\n }<\/span>
\n}<\/span>
\nvoid<\/span> buildst<\/span>(<\/span>ll stmax[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>,<\/span>ll stmin[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>,<\/span>int<\/span> len)<\/span>\/\/\u5efa\u8868<\/span>
\n{<\/span>
\n for<\/span>(<\/span>int<\/span> k=<\/span>1<\/span>;<\/span>(<\/span>1<\/span><<<\/span>k)<\/span><=<\/span>n;<\/span>k++<\/span>)<\/span>
\n {<\/span>
\n int<\/span> h=<\/span>1<\/span><<<\/span>(<\/span>k–<\/span>1<\/span>)<\/span>;<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i+<\/span>(<\/span>1<\/span><<<\/span>k)<\/span>–<\/span>1<\/span><=<\/span>len;<\/span>i++<\/span>)<\/span>
\n {<\/span>
\n stmax[<\/span>k]<\/span>[<\/span>i]<\/span>=<\/span>max<\/span>(<\/span>stmax[<\/span>k–<\/span>1<\/span>]<\/span>[<\/span>i]<\/span>,<\/span>stmax[<\/span>k–<\/span>1<\/span>]<\/span>[<\/span>i+<\/span>h]<\/span>)<\/span>;<\/span>
\n stmin[<\/span>k]<\/span>[<\/span>i]<\/span>=<\/span>min<\/span>(<\/span>stmin[<\/span>k–<\/span>1<\/span>]<\/span>[<\/span>i]<\/span>,<\/span>stmin[<\/span>k–<\/span>1<\/span>]<\/span>[<\/span>i+<\/span>h]<\/span>)<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n}<\/span>
\nll qmax<\/span>(<\/span>ll st[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>,<\/span>int<\/span> l,<\/span>int<\/span> r)<\/span>\/\/\u67e5\u8be2<\/span>
\n{<\/span>
\n int<\/span> k=<\/span>lg2[<\/span>r–<\/span>l+<\/span>1<\/span>]<\/span>;<\/span>
\n return<\/span> max<\/span>(<\/span>st[<\/span>k]<\/span>[<\/span>l]<\/span>,<\/span>st[<\/span>k]<\/span>[<\/span>r–<\/span>(<\/span>1<\/span><<<\/span>k)<\/span>+<\/span>1<\/span>]<\/span>)<\/span>;<\/span>
\n}<\/span>
\nll qmin<\/span>(<\/span>ll st[<\/span>LOG]<\/span>[<\/span>MAXN]<\/span>,<\/span>int<\/span> l,<\/span>int<\/span> r)<\/span>\/\/\u67e5\u8be2<\/span>
\n{<\/span>
\n int<\/span> k=<\/span>lg2[<\/span>r–<\/span>l+<\/span>1<\/span>]<\/span>;<\/span>
\n return<\/span> min<\/span>(<\/span>st[<\/span>k]<\/span>[<\/span>l]<\/span>,<\/span>st[<\/span>k]<\/span>[<\/span>r–<\/span>(<\/span>1<\/span><<<\/span>k)<\/span>+<\/span>1<\/span>]<\/span>)<\/span>;<\/span>
\n}<\/span>
\nll check<\/span>(<\/span>int<\/span> l1,<\/span>int<\/span> r1,<\/span>int<\/span> l2,<\/span>int<\/span> r2)<\/span>
\n{<\/span>
\n bool<\/span> typea0=<\/span>0<\/span>,<\/span>typeb0=<\/span>0<\/span>;<\/span>
\n int<\/span> typea=<\/span>0<\/span>,<\/span>typeb=<\/span>0<\/span>;<\/span>
\n ll maxaz=<\/span>0<\/span>,<\/span>minaz=<\/span>INF,<\/span>maxaf=<\/span>–<\/span>INF,<\/span>minaf=<\/span>0<\/span>;<\/span>
\n ll maxbz=<\/span>0<\/span>,<\/span>minbz=<\/span>INF,<\/span>maxbf=<\/span>–<\/span>INF,<\/span>minbf=<\/span>0<\/span>;<\/span>
\n ll ans=<\/span>0<\/span>;<\/span>
\n \/\/\u67e5\u8be2A<\/span>
\n maxaz=<\/span>qmax<\/span>(<\/span>stazmax,<\/span>l1,<\/span>r1)<\/span>;<\/span>
\n minaz=<\/span>qmin<\/span>(<\/span>stazmin,<\/span>l1,<\/span>r1)<\/span>;<\/span>
\n maxaf=<\/span>qmax<\/span>(<\/span>stafmax,<\/span>l1,<\/span>r1)<\/span>;<\/span>
\n minaf=<\/span>qmin<\/span>(<\/span>stafmin,<\/span>l1,<\/span>r1)<\/span>;<\/span>
\n typea0=<\/span>(<\/span>pa[<\/span>r1]<\/span>–<\/span>pa[<\/span>l1–<\/span>1<\/span>]<\/span>><\/span>0<\/span>)<\/span>;<\/span>
\n bool<\/span> haz=<\/span>(<\/span>maxaz!=<\/span>0<\/span>&&<\/span>minaz!=<\/span>INF)<\/span>;<\/span>
\n bool<\/span> haf=<\/span>(<\/span>maxaf!=<\/span>–<\/span>INF&&<\/span>minaf!=<\/span>0<\/span>)<\/span>;<\/span>
\n if<\/span>(<\/span>!<\/span>haz&&<\/span>!<\/span>haf)<\/span> return<\/span> 0<\/span>;<\/span>\/\/A\u5168\u662f0<\/span>
\n if<\/span>(<\/span>haz&&<\/span>!<\/span>haf)<\/span> typea=<\/span>1<\/span>;<\/span>
\n else<\/span> if<\/span>(<\/span>!<\/span>haz&&<\/span>haf)<\/span> typea=<\/span>2<\/span>;<\/span>
\n else<\/span> if<\/span>(<\/span>haz&&<\/span>haf)<\/span> typea=<\/span>3<\/span>;<\/span>
\n else<\/span> typea=<\/span>0<\/span>;<\/span>
\n \/\/\u67e5\u8be2B<\/span>
\n maxbz=<\/span>qmax<\/span>(<\/span>stbzmax,<\/span>l2,<\/span>r2)<\/span>;<\/span>
\n minbz=<\/span>qmin<\/span>(<\/span>stbzmin,<\/span>l2,<\/span>r2)<\/span>;<\/span>
\n maxbf=<\/span>qmax<\/span>(<\/span>stbfmax,<\/span>l2,<\/span>r2)<\/span>;<\/span>
\n minbf=<\/span>qmin<\/span>(<\/span>stbfmin,<\/span>l2,<\/span>r2)<\/span>;<\/span>
\n typeb0=<\/span>(<\/span>pb[<\/span>r2]<\/span>–<\/span>pb[<\/span>l2–<\/span>1<\/span>]<\/span>><\/span>0<\/span>)<\/span>;<\/span>
\n bool<\/span> hbz=<\/span>(<\/span>maxbz!=<\/span>0<\/span>&&<\/span>minbz!=<\/span>INF)<\/span>;<\/span>
\n bool<\/span> hbf=<\/span>(<\/span>maxbf!=<\/span>–<\/span>INF&&<\/span>minbf!=<\/span>0<\/span>)<\/span>;<\/span>
\n if<\/span>(<\/span>!<\/span>hbz&&<\/span>!<\/span>hbf)<\/span> return<\/span> 0<\/span>;<\/span>\/\/B\u5168\u662f0<\/span>
\n if<\/span>(<\/span>hbz&&<\/span>!<\/span>hbf)<\/span> typeb=<\/span>1<\/span>;<\/span>
\n else<\/span> if<\/span>(<\/span>!<\/span>hbz&&<\/span>hbf)<\/span> typeb=<\/span>2<\/span>;<\/span>
\n else<\/span> if<\/span>(<\/span>hbz&&<\/span>hbf)<\/span> typeb=<\/span>3<\/span>;<\/span>
\n else<\/span> typeb=<\/span>0<\/span>;<\/span>
\n \/\/\u5206\u7c7b\u8ba8\u8bba<\/span>
\n if<\/span>(<\/span>typea==<\/span>1<\/span>)<\/span>
\n {<\/span>
\n if<\/span>(<\/span>typeb==<\/span>1<\/span>)<\/span> ans=<\/span>maxaz*<\/span>minbz;<\/span>
\n else<\/span> if<\/span>(<\/span>typeb==<\/span>2<\/span>)<\/span> ans=<\/span>minaz*<\/span>minbf;<\/span>
\n else<\/span> ans=<\/span>minaz*<\/span>minbf;<\/span>
\n }<\/span>
\n else<\/span> if<\/span>(<\/span>typea==<\/span>2<\/span>)<\/span>
\n {<\/span>
\n if<\/span>(<\/span>typeb==<\/span>1<\/span>)<\/span> ans=<\/span>maxaf*<\/span>maxbz;<\/span>
\n else<\/span> if<\/span>(<\/span>typeb==<\/span>2<\/span>)<\/span> ans=<\/span>minaf*<\/span>maxbf;<\/span>
\n else<\/span> ans=<\/span>maxaf*<\/span>maxbz;<\/span>
\n }<\/span>
\n else<\/span>
\n {<\/span>
\n if<\/span>(<\/span>typeb==<\/span>1<\/span>)<\/span> ans=<\/span>maxaz*<\/span>minbz;<\/span>
\n else<\/span> if<\/span>(<\/span>typeb==<\/span>2<\/span>)<\/span> ans=<\/span>minaf*<\/span>maxbf;<\/span>
\n else<\/span> ans=<\/span>max<\/span>(<\/span>minaz*<\/span>minbf,<\/span>maxaf*<\/span>maxbz)<\/span>;<\/span>
\n }<\/span>
\n if<\/span>(<\/span>typea0)<\/span> ans=<\/span>max<\/span>(<\/span>ans,<\/span>0ll<\/span>)<\/span>;<\/span>
\n if<\/span>(<\/span>typeb0)<\/span> ans=<\/span>min<\/span>(<\/span>ans,<\/span>0ll<\/span>)<\/span>;<\/span>
\n return<\/span> ans;<\/span>
\n}<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span>
\n{<\/span>
\n cin>><\/span>n>><\/span>m>><\/span>q;<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>
\n {<\/span>
\n cin>><\/span>a[<\/span>i]<\/span>;<\/span>
\n pa[<\/span>i]<\/span>=<\/span>pa[<\/span>i–<\/span>1<\/span>]<\/span>+<\/span>(<\/span>a[<\/span>i]<\/span>==<\/span>0<\/span>)<\/span>;<\/span>
\n if<\/span>(<\/span>a[<\/span>i]<\/span>><\/span>0<\/span>)<\/span>
\n {<\/span>
\n stazmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>stazmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>a[<\/span>i]<\/span>;<\/span>
\n stafmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>–<\/span>INF;<\/span>
\n stafmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>0<\/span>;<\/span>
\n }<\/span>
\n else<\/span> if<\/span>(<\/span>a[<\/span>i]<\/span><<\/span>0<\/span>)<\/span>
\n {<\/span>
\n stafmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>stafmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>a[<\/span>i]<\/span>;<\/span>
\n stazmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>0<\/span>;<\/span>
\n stazmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>INF;<\/span>
\n }<\/span>
\n else<\/span>
\n {<\/span>
\n stafmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>–<\/span>INF;<\/span>
\n stazmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>0<\/span>;<\/span>
\n stafmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>–<\/span>INF;<\/span>
\n stafmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>0<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i<=<\/span>m;<\/span>i++<\/span>)<\/span>
\n {<\/span>
\n cin>><\/span>b[<\/span>i]<\/span>;<\/span>
\n pb[<\/span>i]<\/span>=<\/span>pb[<\/span>i–<\/span>1<\/span>]<\/span>+<\/span>(<\/span>b[<\/span>i]<\/span>==<\/span>0<\/span>)<\/span>;<\/span>
\n if<\/span>(<\/span>b[<\/span>i]<\/span>><\/span>0<\/span>)<\/span>
\n {<\/span>
\n stbzmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>stbzmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>b[<\/span>i]<\/span>;<\/span>
\n stbfmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>–<\/span>INF;<\/span>
\n stbfmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>0<\/span>;<\/span>
\n }<\/span>
\n else<\/span> if<\/span>(<\/span>b[<\/span>i]<\/span><<\/span>0<\/span>)<\/span>
\n {<\/span>
\n stbfmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>stbfmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>b[<\/span>i]<\/span>;<\/span>
\n stbzmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>0<\/span>;<\/span>
\n stbzmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>INF;<\/span>
\n }<\/span>
\n else<\/span>
\n {<\/span>
\n stbfmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>–<\/span>INF;<\/span>
\n stbzmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>0<\/span>;<\/span>
\n stbfmax[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>0<\/span>;<\/span>
\n stbfmin[<\/span>0<\/span>]<\/span>[<\/span>i]<\/span>=<\/span>INF;<\/span>
\n }<\/span>
\n }<\/span>
\n initlog<\/span>(<\/span>max<\/span>(<\/span>n,<\/span>m)<\/span>)<\/span>;<\/span>
\n buildst<\/span>(<\/span>stazmax,<\/span>stazmin,<\/span>n)<\/span>;<\/span>
\n buildst<\/span>(<\/span>stafmax,<\/span>stafmin,<\/span>n)<\/span>;<\/span>
\n buildst<\/span>(<\/span>stbzmax,<\/span>stbzmin,<\/span>m)<\/span>;<\/span>
\n buildst<\/span>(<\/span>stbfmax,<\/span>stbfmin,<\/span>m)<\/span>;<\/span>
\n while<\/span>(<\/span>q—<\/span>)<\/span>
\n {<\/span>
\n int<\/span> l1,<\/span>r1,<\/span>l2,<\/span>r2;<\/span>
\n cin>><\/span>l1>><\/span>r1>><\/span>l2>><\/span>r2;<\/span>
\n cout<<<\/span>check<\/span>(<\/span>l1,<\/span>r1,<\/span>l2,<\/span>r2)<\/span><<<\/span>endl;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"<\/p>\n

\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"
\n\u56e0\u4e3a\u662f\u6c42\u6700\u77ed\u65f6\u95f4，\u6240\u4ee5\u660e\u663e\u662f\u7528\u5e7f\u5ea6\u4f18\u5148\u641c\u7d22\u3002
\n\u56e0\u4e3a\u6d41\u661f\u6389\u4e0b\u6765\u4f1a\u635f\u6bc1\u5468\u56f4\u56db\u4e2a\u683c\u5b50，\u6240\u4ee5\u8f93\u5165\u65f6\u5c31\u5f97\u628a\u5b83\u5468\u56f4\u56db\u4e2a\u683c\u5b50\u8d4b\u503c\u505a\u6807\u8bb0\u3002
\n\u7136\u540e\u5c31\u662f\u5e7f\u641c，\u6bcf\u6b21\u8d1d\u831c\u8d70\u65f6\u4e0b\u4e00\u4e2a\u683c\u5b50\u5f97\u6ee1\u8db3\u7684\u6761\u4ef6\u662f：\u7b2c\u4e00，\u6ca1\u8d8a\u754c；\u7b2c\u4e8c，\u8d70\u5230\u65f6\u4e0d\u4f1a\u6709\u6d41\u661f\u6389\u4e0b\u6765\u6216\u8fd9\u5757\u5730\u6ca1\u88ab\u70e7\u7126，\u5373\u8d1d\u831c\u8d70\u5230\u65f6\u7684\u65f6\u95f4\u5c0f\u4e8e\u6d41\u884c\u843d\u5230\u8fd9\u5757\u5730\u7684\u65f6\u95f4\u3002
\n\u7531\u4e8e\u8fd9\u91cc\u53ea\u8bf4\u4e86\u7267\u573a\u5728\u76f4\u89d2\u5750\u6807\u7cfb\u7b2c\u4e00\u8c61\u9650，\u6240\u4ee5\u8d1d\u831c\u8d70\u7684\u4f4d\u7f6e\u53ea\u9700\u8981x\u548cy\u90fd\u5927\u4e8e\u7b49\u4e8e0\u5c31\u884c\u3002<\/p>\n

#<\/span>include<\/span><bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span>
\nint<\/span> m,<\/span>d[<\/span>350<\/span>]<\/span>[<\/span>350<\/span>]<\/span>;<\/span>
\nint<\/span> dx[<\/span>5<\/span>]<\/span>=<\/span>{<\/span>0<\/span>,<\/span>1<\/span>,<\/span>–<\/span>1<\/span>,<\/span>0<\/span>,<\/span>0<\/span>}<\/span>;<\/span>
\nint<\/span> dy[<\/span>5<\/span>]<\/span>=<\/span>{<\/span>0<\/span>,<\/span>0<\/span>,<\/span>0<\/span>,<\/span>1<\/span>,<\/span>–<\/span>1<\/span>}<\/span>;<\/span>
\nstruct<\/span> node<\/span>{<\/span>
\n int<\/span> x,<\/span>y,<\/span>t;<\/span>
\n}<\/span>;<\/span>
\nbool<\/span> vis[<\/span>350<\/span>]<\/span>[<\/span>350<\/span>]<\/span>;<\/span>
\nint<\/span> bfs<\/span>(<\/span>)<\/span>
\n{<\/span>
\n if<\/span>(<\/span>!<\/span>d[<\/span>0<\/span>]<\/span>[<\/span>0<\/span>]<\/span>)<\/span> return<\/span> –<\/span>1<\/span>;<\/span>
\n queue<<\/span>node><\/span> q;<\/span>
\n q.<\/span>push<\/span>(<\/span>{<\/span>0<\/span>,<\/span>0<\/span>,<\/span>0<\/span>}<\/span>)<\/span>;<\/span>
\n vis[<\/span>0<\/span>]<\/span>[<\/span>0<\/span>]<\/span>=<\/span>true<\/span>;<\/span>
\n while<\/span>(<\/span>!<\/span>q.<\/span>empty<\/span>(<\/span>)<\/span>)<\/span>
\n {<\/span>
\n node cur=<\/span>q.<\/span>front<\/span>(<\/span>)<\/span>;<\/span>
\n q.<\/span>pop<\/span>(<\/span>)<\/span>;<\/span>
\n if<\/span>(<\/span>d[<\/span>cur.<\/span>x]<\/span>[<\/span>cur.<\/span>y]<\/span>==<\/span>0x3f3f3f3f<\/span>)<\/span> return<\/span> cur.<\/span>t;<\/span>\/\/\u6ca1\u88ab\u6807\u8bb0\u7684\u683c\u5b50\u5373\u4e3a\u5b89\u5168\u7684<\/span>
\n for<\/span>(<\/span>int<\/span> k=<\/span>1<\/span>;<\/span>k<<\/span>5<\/span>;<\/span>k++<\/span>)<\/span>
\n {<\/span>
\n int<\/span> nx=<\/span>cur.<\/span>x+<\/span>dx[<\/span>k]<\/span>;<\/span>
\n int<\/span> ny=<\/span>cur.<\/span>y+<\/span>dy[<\/span>k]<\/span>;<\/span>
\n if<\/span>(<\/span>nx>=<\/span>0<\/span>&&<\/span>ny>=<\/span>0<\/span>&&<\/span>!<\/span>vis[<\/span>nx]<\/span>[<\/span>ny]<\/span>)<\/span>{<\/span>
\n int<\/span> nt=<\/span>cur.<\/span>t+<\/span>1<\/span>;<\/span>
\n if<\/span>(<\/span>d[<\/span>nx]<\/span>[<\/span>ny]<\/span>><\/span>nt)<\/span>{<\/span>
\n vis[<\/span>nx]<\/span>[<\/span>ny]<\/span>=<\/span>true<\/span>;<\/span>
\n q.<\/span>push<\/span>(<\/span>{<\/span>nx,<\/span>ny,<\/span>nt}<\/span>)<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> –<\/span>1<\/span>;<\/span>
\n}<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span>
\n{<\/span>
\n cin>><\/span>m;<\/span>
\n memset<\/span>(<\/span>d,<\/span>0x3f<\/span>,<\/span>sizeof<\/span>(<\/span>d)<\/span>)<\/span>;<\/span>
\n for<\/span>(<\/span>int<\/span> i=<\/span>0<\/span>;<\/span>i<<\/span>m;<\/span>i++<\/span>)<\/span>
\n {<\/span>
\n int<\/span> x_1,<\/span>y_1,<\/span>t_1;<\/span>
\n cin>><\/span>x_1>><\/span>y_1>><\/span>t_1;<\/span>
\n for<\/span>(<\/span>int<\/span> k=<\/span>0<\/span>;<\/span>k<<\/span>5<\/span>;<\/span>k++<\/span>)<\/span>
\n {<\/span>
\n int<\/span> nx=<\/span>x_1+<\/span>dx[<\/span>k]<\/span>;<\/span>
\n int<\/span> ny=<\/span>y_1+<\/span>dy[<\/span>k]<\/span>;<\/span>
\n if<\/span>(<\/span>nx>=<\/span>0<\/span>&&<\/span>ny>=<\/span>0<\/span>)<\/span>{<\/span>
\n if<\/span>(<\/span>t_1<<\/span>d[<\/span>nx]<\/span>[<\/span>ny]<\/span>)<\/span>
\n d[<\/span>nx]<\/span>[<\/span>ny]<\/span>=<\/span>t_1;<\/span>\/\/\u6807\u8bb0\u6d41\u661f\u6389\u4e0b\u6765\u7684\u4f4d\u7f6e\u548c\u5468\u56f4\u56db\u4e2a\u4f1a\u88ab\u6467\u6bc1\u7684\u683c\u5b50<\/span>
\n }<\/span>
\n }<\/span>
\n }<\/span>
\n cout<<<\/span>bfs<\/span>(<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

25\u5206
\n\u5148\u770b\u6700\u7b80\u5355\u7684\u60c5\u51b5\u3002\u5c31\u662f\u5f53A\u3001B\u6570\u7ec4\u5747\u4e3a\u6b63\u6570\u7684\u65f6\u5019，\u76f4\u63a5\u8f93\u51faA\u7684\u6700\u5927\u503c\u548c\u6700\u5c0f\u503c\u7684\u4e58\u79ef\u3002
\n#include
\nusing namespace std;
\nlong long n,m,q,x[1005],y[1005];
\nint main()
\n{cin>>n>>m>>q;for(int i1;i>x[i];}for(int i1;i>y[i];}while(q–){long long l1,r1<\/p>\n","protected":false},"author":2,"featured_media":93318,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[427],"topic":[],"class_list":["post-93322","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-server","tag-427"],"yoast_head":"\n\u6d1b\u8c37P2895\u3001P8818 \u4e24\u9898\u7684\u9898\u89e3 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.wsisp.com\/helps\/93322.html\" \/>\n<meta property=\"og:locale\" content=\"zh_CN\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"\u6d1b\u8c37P2895\u3001P8818 \u4e24\u9898\u7684\u9898\u89e3 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"og:description\" content=\"25\u5206 \u5148\u770b\u6700\u7b80\u5355\u7684\u60c5\u51b5\u3002\u5c31\u662f\u5f53A\u3001B\u6570\u7ec4\u5747\u4e3a\u6b63\u6570\u7684\u65f6\u5019，\u76f4\u63a5\u8f93\u51faA\u7684\u6700\u5927\u503c\u548c\u6700\u5c0f\u503c\u7684\u4e58\u79ef\u3002 #include using namespace std; long long n,m,q,x[1005],y[1005]; int main() {cin>>n>>m>>q;for(int i1;i>x[i];}for(int i1;i>y[i];}while(q--){long long l1,r1\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wsisp.com\/helps\/93322.html\" \/>\n<meta property=\"og:site_name\" content=\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"article:published_time\" content=\"2026-08-12T04:33:53+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260812043352-6a7bf7b01ac5d.png\" \/>\n<meta name=\"author\" content=\"admin\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u4f5c\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"admin\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4\" \/>\n\t<meta name=\"twitter:data2\" content=\"7 \u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/93322.html\",\"url\":\"https:\/\/www.wsisp.com\/helps\/93322.html\",\"name\":\"\u6d1b\u8c37P2895\u3001P8818 \u4e24\u9898\u7684\u9898\u89e3 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"isPartOf\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\"},\"datePublished\":\"2026-08-12T04:33:53+00:00\",\"dateModified\":\"2026-08-12T04:33:53+00:00\",\"author\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\"},\"breadcrumb\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/93322.html#breadcrumb\"},\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.wsisp.com\/helps\/93322.html\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/93322.html#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9875\",\"item\":\"https:\/\/www.wsisp.com\/helps\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"\u6d1b\u8c37P2895\u3001P8818 \u4e24\u9898\u7684\u9898\u89e3\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\",\"url\":\"https:\/\/www.wsisp.com\/helps\/\",\"name\":\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"description\":\"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"zh-Hans\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\",\"name\":\"admin\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-Hans\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"contentUrl\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"caption\":\"admin\"},\"sameAs\":[\"http:\/\/wp.wsisp.com\"],\"url\":\"https:\/\/www.wsisp.com\/helps\/author\/admin\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"\u6d1b\u8c37P2895\u3001P8818 \u4e24\u9898\u7684\u9898\u89e3 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.wsisp.com\/helps\/93322.html","og_locale":"zh_CN","og_type":"article","og_title":"\u6d1b\u8c37P2895\u3001P8818 \u4e24\u9898\u7684\u9898\u89e3 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","og_description":"25\u5206 \u5148\u770b\u6700\u7b80\u5355\u7684\u60c5\u51b5\u3002\u5c31\u662f\u5f53A\u3001B\u6570\u7ec4\u5747\u4e3a\u6b63\u6570\u7684\u65f6\u5019，\u76f4\u63a5\u8f93\u51faA\u7684\u6700\u5927\u503c\u548c\u6700\u5c0f\u503c\u7684\u4e58\u79ef\u3002 #include using namespace std; long long n,m,q,x[1005],y[1005]; int main() {cin>>n>>m>>q;for(int i1;i>x[i];}for(int i1;i>y[i];}while(q--){long long l1,r1","og_url":"https:\/\/www.wsisp.com\/helps\/93322.html","og_site_name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","article_published_time":"2026-08-12T04:33:53+00:00","og_image":[{"url":"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260812043352-6a7bf7b01ac5d.png"}],"author":"admin","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005":"admin","\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4":"7 \u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.wsisp.com\/helps\/93322.html","url":"https:\/\/www.wsisp.com\/helps\/93322.html","name":"\u6d1b\u8c37P2895\u3001P8818 \u4e24\u9898\u7684\u9898\u89e3 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","isPartOf":{"@id":"https:\/\/www.wsisp.com\/helps\/#website"},"datePublished":"2026-08-12T04:33:53+00:00","dateModified":"2026-08-12T04:33:53+00:00","author":{"@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41"},"breadcrumb":{"@id":"https:\/\/www.wsisp.com\/helps\/93322.html#breadcrumb"},"inLanguage":"zh-Hans","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wsisp.com\/helps\/93322.html"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.wsisp.com\/helps\/93322.html#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9875","item":"https:\/\/www.wsisp.com\/helps"},{"@type":"ListItem","position":2,"name":"\u6d1b\u8c37P2895\u3001P8818 \u4e24\u9898\u7684\u9898\u89e3"}]},{"@type":"WebSite","@id":"https:\/\/www.wsisp.com\/helps\/#website","url":"https:\/\/www.wsisp.com\/helps\/","name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","description":"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"zh-Hans"},{"@type":"Person","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41","name":"admin","image":{"@type":"ImageObject","inLanguage":"zh-Hans","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/","url":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","contentUrl":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","caption":"admin"},"sameAs":["http:\/\/wp.wsisp.com"],"url":"https:\/\/www.wsisp.com\/helps\/author\/admin"}]}},"_links":{"self":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/93322","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/comments?post=93322"}],"version-history":[{"count":0,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/93322\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media\/93318"}],"wp:attachment":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media?parent=93322"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/categories?post=93322"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/tags?post=93322"},{"taxonomy":"topic","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/topic?post=93322"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}