{"id":44,"date":"2022-06-04T10:52:00","date_gmt":"2022-06-04T02:52:00","guid":{"rendered":"http:\/\/ubuntu.tim-wcx.ltd\/wordpress\/index.php\/2022\/06\/04\/2020-08-02-%e7%ba%bf%e6%ae%b5%e6%a0%91\/"},"modified":"2022-06-04T10:52:00","modified_gmt":"2022-06-04T02:52:00","slug":"2020-08-02-%e7%ba%bf%e6%ae%b5%e6%a0%91","status":"publish","type":"post","link":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/2022\/06\/04\/2020-08-02-%e7%ba%bf%e6%ae%b5%e6%a0%91\/","title":{"rendered":"2020-08-02 \u7ebf\u6bb5\u6811"},"content":{"rendered":"

\n <\/path>\n <\/svg><\/p>\n

http:\/\/icpc.upc.edu.cn\/problem.php?id=3756<\/a><\/p>\n

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

\u4ece\u524d\u6709\u4e00\u4e2a\u8d38\u6613\u5e02\u573a\uff0c\u5728\u4e00\u4f4d\u6267\u653f\u5b98\u5230\u6765\u4e4b\u524d\u90fd\u662f\u975e\u5e38\u7e41\u8363\u7684\uff0c\u81ea\u4ece\u4ed6\u6765\u4e86\u4e4b\u540e\uff0c\u53d1\u5e03\u4e86\u4e00\u7cfb\u5217\u5947\u602a\u7684\u653f\u4ee4\uff0c\u5bfc\u81f4\u8d38\u6613\u5e02\u573a\u7684\u8870\u843d\u3002
\u6709n\u4e2a\u5546\u8d29\uff0c\u4ece 0\u223cn\u22121\u7f16\u53f7\uff0c\u6bcf\u4e2a\u5546\u8d29\u7684\u5546\u54c1\u6709\u4e00\u4e2a\u4ef7\u683c ai\uff0c\u6709\u4e24\u79cd\u653f\u4ee4\uff1a
1.l,r,c\uff0c\u5bf9\u4e8e i\u2208[l,r],ai\u2190ai+c
2.l,r,d\uff0c\u5bf9\u4e8e i\u2208[l,r],ai\u2190\u230aai\/d\u230b,ai \u2190\u230aai\/d\u230b
\u73b0\u5728\u6709\u4e00\u4e2a\u5916\u4e61\u7684\u65c5\u5ba2\u60f3\u8981\u4e86\u89e3\u8d38\u6613\u5e02\u573a\u7684\u4fe1\u606f\uff0c\u6709\u4e24\u79cd\u8be2\u95ee\u65b9\u5f0f\uff1a
1.\u7ed9\u5b9a l,r\uff0c\u6c42 mini\u2208[l,r]ai
2.\u7ed9\u5b9a l,r\uff0c\u6c42 \u2211i\u2208[l,r]ai<\/p>\n

<\/a>\u8f93\u5165<\/h5>\n

\u7b2c\u4e00\u884c\u4e3a\u4e24\u4e2a\u7a7a\u683c\u9694\u5f00\u7684\u6574\u6570 n,q\u5206\u522b\u8868\u793a\u5546\u8d29\u4e2a\u6570\u548c\u653f\u4ee4 + \u8be2\u95ee\u4e2a\u6570\u3002
\u7b2c\u4e8c\u884c\u5305\u542bn\u4e2a\u7531\u7a7a\u683c\u9694\u5f00\u7684\u6574\u6570 a0\u223can\u22121
\u63a5\u4e0b\u6765q\u884c\uff0c\u6bcf\u884c\u8868\u793a\u4e00\u4e2a\u64cd\u4f5c\uff0c\u7b2c\u4e00\u4e2a\u6570\u8868\u793a\u64cd\u4f5c\u7f16\u53f7 1\u223c4\u63a5\u4e0b\u6765\u7684\u8f93\u5165\u548c\u95ee\u9898\u63cf\u8ff0\u4e00\u81f4\u3002<\/p>\n

<\/a>\u8f93\u51fa<\/h5>\n

\u5bf9\u4e8e\u6bcf\u4e2a 3\u30014 \u64cd\u4f5c\uff0c\u8f93\u51fa\u8be2\u95ee\u7b54\u6848\u3002<\/p>\n

<\/a>\u6837\u4f8b\u8f93\u5165<\/h5>\n
10 10\n-5 -4 -3 -2 -1 0 1 2 3 4\n1 0 4 1\n1 5 9 1\n2 0 9 3\n3 0 9\n4 0 9\n3 0 1\n4 2 3\n3 4 5\n4 6 7\n3 8 9\n<\/code><\/pre>\n
<\/a>\u6837\u4f8b\u8f93\u51fa<\/h5>\n
-2\n-2\n-2\n-2\n0\n1\n1\n<\/code><\/pre>\n
\u8fd9\u9053\u9898\u76ee\u4e3b\u8981\u8003\u67e5\u4e86\u7ebf\u6bb5\u6811\u7684\u6807\u8bb0\u548c\u4e0b\u653e\u53ca\u5c06\u9664\u6cd5\u8f6c\u4e3a\u51cf\u6cd5\u7684\u601d\u60f3\uff0c\u7edf\u8ba1\u6bcf\u4e00\u6bb5\u7684max\u548cmin\uff0c\u5224\u65ad\u6700\u5927\u503c\u548c\u6700\u5c0f\u503c\u7ecf\u8fc7\u9664\u6cd5\u4ee5\u540e\u6240\u51cf\u6389\u7684\u6570\u5b57\u662f\u5426\u76f8\u540c\uff0c\u5982\u679c\u76f8\u540c\uff0c\u5219\u8fd9\u4e00\u6bb5\u90fd\u53ef\u4ee5\u51cf\u6389\u8fd9\u4e2a\u6570\u5b57\uff0c\u4e0b\u653e\u6807\u8bb0\u5373\u53ef\u3002<\/p>\n
#pragma<\/span> GCC optimize(1)<\/span>\n#pragma<\/span> GCC optimize(2)<\/span>\n#pragma<\/span> GCC optimize(3,\"Ofast\",\"inline\")<\/span>\n#include<\/span><\/span><\/span>\n#define<\/span> inf 0x3f3f3f<\/span>\nusing<\/span> namespace<\/span> std;<\/span>\ntypedef<\/span> long<\/span> long<\/span> ll;<\/span>\nll num[<\/span>400500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll sum[<\/span>400500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll minn[<\/span>400500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll maxx[<\/span>400500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll lazy[<\/span>400500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll pushup<\/span>(<\/span>ll t)<\/span>\n{<\/span>\n    sum[<\/span>t]<\/span>=<\/span>sum[<\/span>2<\/span>*<\/span>t]<\/span>+<\/span>sum[<\/span>2<\/span>*<\/span>t+<\/span>1<\/span>]<\/span>;<\/span>\n    maxx[<\/span>t]<\/span>=<\/span>max<\/span>(<\/span>maxx[<\/span>2<\/span>*<\/span>t]<\/span>,<\/span>maxx[<\/span>2<\/span>*<\/span>t+<\/span>1<\/span>]<\/span>)<\/span>;<\/span>\n    minn[<\/span>t]<\/span>=<\/span>min<\/span>(<\/span>minn[<\/span>2<\/span>*<\/span>t]<\/span>,<\/span>minn[<\/span>2<\/span>*<\/span>t+<\/span>1<\/span>]<\/span>)<\/span>;<\/span>\n}<\/span>\nll pushlazy<\/span>(<\/span>ll t,<\/span>ll lz,<\/span>ll len)<\/span>\n{<\/span>\n    sum[<\/span>t]<\/span>+<\/span>=<\/span>lz*<\/span>len;<\/span>\n    minn[<\/span>t]<\/span>+<\/span>=<\/span>lz;<\/span>\n    maxx[<\/span>t]<\/span>+<\/span>=<\/span>lz;<\/span>\n    lazy[<\/span>t]<\/span>+<\/span>=<\/span>lz;<\/span>\n}<\/span>\nll pushdown<\/span>(<\/span>ll l,<\/span>ll r,<\/span>ll t)<\/span>\n{<\/span>\n    if<\/span>(<\/span>lazy[<\/span>t]<\/span>!=<\/span>0<\/span>)<\/span>\n    {<\/span>\n        ll mid=<\/span>(<\/span>l+<\/span>r)<\/span>\/<\/span>2<\/span>;<\/span>\n        pushlazy<\/span>(<\/span>2<\/span>*<\/span>t,<\/span>lazy[<\/span>t]<\/span>,<\/span>mid-<\/span>l+<\/span>1<\/span>)<\/span>;<\/span>\n        pushlazy<\/span>(<\/span>2<\/span>*<\/span>t+<\/span>1<\/span>,<\/span>lazy[<\/span>t]<\/span>,<\/span>r-<\/span>mid)<\/span>;<\/span>\n        lazy[<\/span>t]<\/span>=<\/span>0<\/span>;<\/span>\n    }<\/span>\n}<\/span>\nll build<\/span>(<\/span>ll l,<\/span>ll r,<\/span>ll t)<\/span>\n{<\/span>\n    lazy[<\/span>t]<\/span>=<\/span>0<\/span>;<\/span>\n    if<\/span>(<\/span>l==<\/span>r)<\/span>\n    {<\/span>\n        sum[<\/span>t]<\/span>=<\/span>minn[<\/span>t]<\/span>=<\/span>maxx[<\/span>t]<\/span>=<\/span>num[<\/span>l]<\/span>;<\/span>\n        return<\/span> 0<\/span>;<\/span>\n    }<\/span>\n    ll mid=<\/span>(<\/span>l+<\/span>r)<\/span>\/<\/span>2<\/span>;<\/span>\n    build<\/span>(<\/span>l,<\/span>mid,<\/span>t*<\/span>2<\/span>)<\/span>;<\/span>\n    build<\/span>(<\/span>mid+<\/span>1<\/span>,<\/span>r,<\/span>2<\/span>*<\/span>t+<\/span>1<\/span>)<\/span>;<\/span>\n    pushup<\/span>(<\/span>t)<\/span>;<\/span>\n}<\/span>\nll add<\/span>(<\/span>ll x,<\/span>ll l,<\/span>ll r,<\/span>ll L,<\/span>ll R,<\/span>ll t)<\/span>\n{<\/span>\n    if<\/span>(<\/span>l>=<\/span>L&&<\/span>r<=<\/span>R)<\/span>\n    {<\/span>\n        lazy[<\/span>t]<\/span>+<\/span>=<\/span>x;<\/span>\n        sum[<\/span>t]<\/span>+<\/span>=<\/span>(<\/span>r-<\/span>l+<\/span>1<\/span>)<\/span>*<\/span>x;<\/span>\n        minn[<\/span>t]<\/span>+<\/span>=<\/span>x;<\/span>\n        maxx[<\/span>t]<\/span>+<\/span>=<\/span>x;<\/span>\n        return<\/span> 0<\/span>;<\/span>\n    }<\/span>\n    pushdown<\/span>(<\/span>l,<\/span>r,<\/span>t)<\/span>;<\/span>\n    ll mid=<\/span>(<\/span>l+<\/span>r)<\/span>\/<\/span>2<\/span>;<\/span>\n    if<\/span>(<\/span>L<=<\/span>mid)<\/span>\n        add<\/span>(<\/span>x,<\/span>l,<\/span>mid,<\/span>L,<\/span>R,<\/span>2<\/span>*<\/span>t)<\/span>;<\/span>\n    if<\/span>(<\/span>R><\/span>mid)<\/span>\n        add<\/span>(<\/span>x,<\/span>mid+<\/span>1<\/span>,<\/span>r,<\/span>L,<\/span>R,<\/span>2<\/span>*<\/span>t+<\/span>1<\/span>)<\/span>;<\/span>\n    pushup<\/span>(<\/span>t)<\/span>;<\/span>\n}<\/span>\nll div<\/span>(<\/span>ll x,<\/span>ll l,<\/span>ll r,<\/span>ll L,<\/span>ll R,<\/span>ll t)<\/span>\n{<\/span>\n    if<\/span>(<\/span>l>=<\/span>L&&<\/span>r<=<\/span>R)<\/span>\n    {<\/span>\n        ll A,<\/span>B;<\/span>\n        if<\/span>(<\/span>minn[<\/span>t]<\/span><<\/span>0<\/span>)<\/span>\n            A=<\/span>(<\/span>minn[<\/span>t]<\/span>-<\/span>x+<\/span>1<\/span>)<\/span>\/<\/span>x;<\/span>\n        else<\/span>\n            A=<\/span>minn[<\/span>t]<\/span>\/<\/span>x;<\/span>\n        if<\/span>(<\/span>maxx[<\/span>t]<\/span><<\/span>0<\/span>)<\/span>\n            B=<\/span>(<\/span>maxx[<\/span>t]<\/span>-<\/span>x+<\/span>1<\/span>)<\/span>\/<\/span>x;<\/span>\n        else<\/span>\n            B=<\/span>maxx[<\/span>t]<\/span>\/<\/span>x;<\/span>\n        if<\/span>(<\/span>A-<\/span>minn[<\/span>t]<\/span>==<\/span>B-<\/span>maxx[<\/span>t]<\/span>)<\/span>\n        {<\/span>\n            pushlazy<\/span>(<\/span>t,<\/span>B-<\/span>maxx[<\/span>t]<\/span>,<\/span>r-<\/span>l+<\/span>1<\/span>)<\/span>;<\/span>\n            return<\/span> 0<\/span>;<\/span>\n        }<\/span>\n    }<\/span>\n    pushdown<\/span>(<\/span>l,<\/span>r,<\/span>t)<\/span>;<\/span>\n    ll mid=<\/span>(<\/span>l+<\/span>r)<\/span>\/<\/span>2<\/span>;<\/span>\n    if<\/span>(<\/span>L<=<\/span>mid)<\/span>\n        div<\/span>(<\/span>x,<\/span>l,<\/span>mid,<\/span>L,<\/span>R,<\/span>2<\/span>*<\/span>t)<\/span>;<\/span>\n    if<\/span>(<\/span>R><\/span>mid)<\/span>\n        div<\/span>(<\/span>x,<\/span>mid+<\/span>1<\/span>,<\/span>r,<\/span>L,<\/span>R,<\/span>2<\/span>*<\/span>t+<\/span>1<\/span>)<\/span>;<\/span>\n    pushup<\/span>(<\/span>t)<\/span>;<\/span>\n}<\/span>\nll querysum<\/span>(<\/span>ll l,<\/span>ll r,<\/span>ll L,<\/span>ll R,<\/span>ll t)<\/span>\n{<\/span>\n    if<\/span>(<\/span>l>=<\/span>L&&<\/span>r<=<\/span>R)<\/span>\n        return<\/span> sum[<\/span>t]<\/span>;<\/span>\n    pushdown<\/span>(<\/span>l,<\/span>r,<\/span>t)<\/span>;<\/span>\n    ll mid=<\/span>(<\/span>l+<\/span>r)<\/span>\/<\/span>2<\/span>;<\/span>\n    ll ans=<\/span>0<\/span>;<\/span>\n    if<\/span>(<\/span>L<=<\/span>mid)<\/span>\n        ans+<\/span>=<\/span>querysum<\/span>(<\/span>l,<\/span>mid,<\/span>L,<\/span>R,<\/span>2<\/span>*<\/span>t)<\/span>;<\/span>\n    if<\/span>(<\/span>R><\/span>mid)<\/span>\n        ans+<\/span>=<\/span>querysum<\/span>(<\/span>mid+<\/span>1<\/span>,<\/span>r,<\/span>L,<\/span>R,<\/span>2<\/span>*<\/span>t+<\/span>1<\/span>)<\/span>;<\/span>\n    return<\/span> ans;<\/span>\n}<\/span>\nll querymin<\/span>(<\/span>ll l,<\/span>ll r,<\/span>ll L,<\/span>ll R,<\/span>ll t)<\/span>\n{<\/span>\n    if<\/span>(<\/span>l>=<\/span>L&&<\/span>r<=<\/span>R)<\/span>\n        return<\/span> minn[<\/span>t]<\/span>;<\/span>\n    pushdown<\/span>(<\/span>l,<\/span>r,<\/span>t)<\/span>;<\/span>\n    ll mid=<\/span>(<\/span>l+<\/span>r)<\/span>\/<\/span>2<\/span>;<\/span>\n    ll ans=<\/span>inf;<\/span>\n    if<\/span>(<\/span>L<=<\/span>mid)<\/span>\n        ans=<\/span>min<\/span>(<\/span>querymin<\/span>(<\/span>l,<\/span>mid,<\/span>L,<\/span>R,<\/span>2<\/span>*<\/span>t)<\/span>,<\/span>ans)<\/span>;<\/span>\n    if<\/span>(<\/span>R><\/span>mid)<\/span>\n        ans=<\/span>min<\/span>(<\/span>querymin<\/span>(<\/span>mid+<\/span>1<\/span>,<\/span>r,<\/span>L,<\/span>R,<\/span>2<\/span>*<\/span>t+<\/span>1<\/span>)<\/span>,<\/span>ans)<\/span>;<\/span>\n    return<\/span> ans;<\/span>\n}<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    ll n,<\/span>m,<\/span>a,<\/span>b,<\/span>c,<\/span>d;<\/span>\n    scanf<\/span>(<\/span>\"%lld%lld\"<\/span>,<\/span>&<\/span>n,<\/span>&<\/span>m)<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>\n        scanf<\/span>(<\/span>\"%lld\"<\/span>,<\/span>&<\/span>num[<\/span>i]<\/span>)<\/span>;<\/span>\n    build<\/span>(<\/span>1<\/span>,<\/span>n,<\/span>1<\/span>)<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>1<\/span>;<\/span>i<=<\/span>m;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        scanf<\/span>(<\/span>\"%lld\"<\/span>,<\/span>&<\/span>a)<\/span>;<\/span>\n        if<\/span>(<\/span>a==<\/span>1<\/span>)<\/span>\n        {<\/span>\n            scanf<\/span>(<\/span>\"%lld%lld%lld\"<\/span>,<\/span>&<\/span>b,<\/span>&<\/span>c,<\/span>&<\/span>d)<\/span>;<\/span>\n            add<\/span>(<\/span>d,<\/span>1<\/span>,<\/span>n,<\/span>b+<\/span>1<\/span>,<\/span>c+<\/span>1<\/span>,<\/span>1<\/span>)<\/span>;<\/span>\n        }<\/span>\n        else<\/span> if<\/span>(<\/span>a==<\/span>2<\/span>)<\/span>\n        {<\/span>\n            scanf<\/span>(<\/span>\"%lld%lld%lld\"<\/span>,<\/span>&<\/span>b,<\/span>&<\/span>c,<\/span>&<\/span>d)<\/span>;<\/span>\n            div<\/span>(<\/span>d,<\/span>1<\/span>,<\/span>n,<\/span>b+<\/span>1<\/span>,<\/span>c+<\/span>1<\/span>,<\/span>1<\/span>)<\/span>;<\/span>\n        }<\/span>\n        else<\/span> if<\/span>(<\/span>a==<\/span>3<\/span>)<\/span>\n        {<\/span>\n            scanf<\/span>(<\/span>\"%lld%lld\"<\/span>,<\/span>&<\/span>b,<\/span>&<\/span>c)<\/span>;<\/span>\n            printf<\/span>(<\/span>\"%lldn\"<\/span>,<\/span>querymin<\/span>(<\/span>1<\/span>,<\/span>n,<\/span>b+<\/span>1<\/span>,<\/span>c+<\/span>1<\/span>,<\/span>1<\/span>)<\/span>)<\/span>;<\/span>\n        }<\/span>\n        else<\/span>\n        {<\/span>\n            scanf<\/span>(<\/span>\"%lld%lld\"<\/span>,<\/span>&<\/span>b,<\/span>&<\/span>c)<\/span>;<\/span>\n            printf<\/span>(<\/span>\"%lldn\"<\/span>,<\/span>querysum<\/span>(<\/span>1<\/span>,<\/span>n,<\/span>b+<\/span>1<\/span>,<\/span>c+<\/span>1<\/span>,<\/span>1<\/span>)<\/span>)<\/span>;<\/span>\n        }<\/span>\n    }<\/span>\n}<\/span>\n\n<\/code><\/pre>\n
<\/a>\u9898\u76ee\u63cf\u8ff0<\/h5>\n
licunchun \u5728\u5212\u6c34\u3002<\/p>\n
licunchun \u6700\u8fd1\u8ff7\u4e0a\u4e86\u4e00\u6b3e\u6253\u602a\u517d\u7684\u6e38\u620f\u3002<\/p>\n
n\u4e2a\u602a\u517d\u7ad9\u6210\u4e86\u4e00\u6392\uff0c\u6bcf\u4e2a\u602a\u517d\u90fd\u6709\u4e00\u4e2a\u9632\u5fa1\u503cai\u3002<\/p>\n
licunchun \u4f1a\u6309\u7167\u4e00\u79cd\u5947\u602a\u7684\u987a\u5e8f\u6253\u602a\u517d\u3002<\/p>\n
\u5bf9\u4e8e\u6bcf\u4e00\u6b21\u6253\u602a\u517d\uff0clicunchun \u9700\u8981\u627e\u5230\u602a\u517d\u5e8f\u5217\u4e2d\u51fa\u73b0\u6b21\u6570\u5927\u4e8e\u7b49\u4e8e2\u7684\u9632\u5fa1\u6700\u5c0f\u503cx\uff0c\u627e\u5230x\u76842\u4e2a\u6700\u5c0f\u4e0b\u6807i,j\uff0c\u5c06\u7b2ci\u4e2a\u602a\u517d\u6253\u6b7b\u5e76\u4ece\u5e8f\u5217\u4e2d\u9664\u53bb\uff0c\u5c06\u7b2cj\u4e2a\u602a\u517d\u7684\u9632\u5fa1\u503caj\u6539\u4e3a2x\u3002<\/p>\n
licunchun \u60f3\u77e5\u9053\uff0c\u5728\u53cd\u590d\u8fdb\u884c\u6253\u602a\u517d\u540e\uff0c\u602a\u517d\u5e8f\u5217\u7684\u6700\u7ec8\u72b6\u6001\u662f\u600e\u6837\u7684\u3002<\/p>\n
<\/a>\u8f93\u5165<\/h5>\n
\u51712\u884c\u3002<\/p>\n
\u7b2c1\u884c\uff0c\u8f93\u5165\u6b63\u6574\u6570n\uff0c\u8868\u793a\u602a\u517d\u4e2a\u6570\u3002<\/p>\n
\u7b2c1\u884c\uff0c\u8f93\u5165\u7b2ci\u4e2a\u602a\u517d\u7684\u9632\u5fa1\u503cai\u3002<\/p>\n
<\/a>\u8f93\u51fa<\/h5>\n
\u51712\u884c\u3002<\/p>\n
\u7b2c1\u884c\uff0c\u8f93\u51fa\u5269\u4f59\u602a\u517d\u4e2a\u6570ans\u3002<\/p>\n
\u7b2c2\u884c\uff0c\u5171ans\u6570\uff0c\u6309\u987a\u5e8f\u8f93\u51fa\u4ecd\u7136\u5728\u602a\u517d\u5e8f\u5217\u4e2d\u7684\u602a\u517d\u7684\u9632\u5fa1\u503cai\u3002<\/p>\n
<\/a>\u6837\u4f8b\u8f93\u5165<\/h5>\n
7\n3 4 1 2 2 1 1\n<\/code><\/pre>\n
<\/a>\u6837\u4f8b\u8f93\u51fa<\/h5>\n
4\n3 8 2 1 \n<\/code><\/pre>\n
\u63d0\u793a
 \"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"
 \u7b80\u5355\u7684\u6a21\u62df\uff0cpriority_queue\u548cpair\u7ed3\u5408\u8d77\u6765\u4f7f\u7528<\/p>\n
#include<\/span> <\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\ntypedef<\/span> long<\/span> long<\/span> ll;<\/span>\nll a[<\/span>155000<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\ntypedef<\/span> pair<<\/span>ll,<\/span>ll><\/span> node_pair;<\/span>\npriority_queue<<\/span>node_pair,<\/span>vector<<\/span>node_pair><\/span>,<\/span>greater<<\/span>node_pair><\/span> ><\/span> q;<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    ll n;<\/span>\n    scanf<\/span>(<\/span>\"%lld\"<\/span>,<\/span>&<\/span>n)<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        scanf<\/span>(<\/span>\"%lld\"<\/span>,<\/span>&<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>\n        q.<\/span>push<\/span>(<\/span>make_pair<\/span>(<\/span>a[<\/span>i]<\/span>,<\/span>i)<\/span>)<\/span>;<\/span>\n    }<\/span>\n    while<\/span>(<\/span>q.<\/span>size<\/span>(<\/span>)<\/span>!=<\/span>1<\/span>)<\/span>\n    {<\/span>\n        node_pair b1=<\/span>q.<\/span>top<\/span>(<\/span>)<\/span>;<\/span>\n        q.<\/span>pop<\/span>(<\/span>)<\/span>;<\/span>\n        node_pair b2=<\/span>q.<\/span>top<\/span>(<\/span>)<\/span>;<\/span>\n        if<\/span>(<\/span>b1.<\/span>first==<\/span>b2.<\/span>first)<\/span>\n        {<\/span>\n            a[<\/span>b2.<\/span>second]<\/span>*<\/span>=<\/span>2<\/span>;<\/span>\n            a[<\/span>b1.<\/span>second]<\/span>=<\/span>-<\/span>1<\/span>;<\/span>\n            q.<\/span>pop<\/span>(<\/span>)<\/span>;<\/span>\n            q.<\/span>push<\/span>(<\/span>make_pair<\/span>(<\/span>a[<\/span>b2.<\/span>second]<\/span>,<\/span>b2.<\/span>second)<\/span>)<\/span>;<\/span>\n        }<\/span>\n    }<\/span>\n    queue<<\/span>ll><\/span>w;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n        if<\/span>(<\/span>a[<\/span>i]<\/span>!=<\/span>-<\/span>1<\/span>)<\/span>\n            w.<\/span>push<\/span>(<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>\n    }<\/span>\n    printf<\/span>(<\/span>\"%dn\"<\/span>,<\/span>w.<\/span>size<\/span>(<\/span>)<\/span>)<\/span>;<\/span>\n    while<\/span>(<\/span>!<\/span>w.<\/span>empty<\/span>(<\/span>)<\/span>)<\/span>\n    {<\/span>\n        printf<\/span>(<\/span>\"%lld \"<\/span>,<\/span>w.<\/span>front<\/span>(<\/span>)<\/span>)<\/span>;<\/span>\n        w.<\/span>pop<\/span>(<\/span>)<\/span>;<\/span>\n    }<\/span>\n    return<\/span> 0<\/span>;<\/span>\n}<\/span>\n\n<\/code><\/pre>\n
<\/a>\u9898\u76ee\u63cf\u8ff0<\/h5>\n
licunchun \u627e\u5230\u4e86\u4e00\u5f20\u753b\u3002<\/p>\n
licunchun \u5b66\u4e60\u4e86\u819c\u6cd5\uff0c\u60f3\u8981\u4e00\u5757\u4e00\u5757\u5730\uff0c\u8ba9\u91cc\u9762\u7684\u989c\u8272\u6d88\u5931\u3002<\/p>\n
\u7167\u7247\u7684\u989c\u8272\u53ea\u6709\u4e00\u884c\u3002licunchun \u6bcf\u6b21\u53ef\u4ee5\u9009\u62e9\u4e2d\u95f4\u4e00\u6bb5\u76f8\u540c\u989c\u8272\u7684\u4e00\u6bb5\u76f4\u63a5\u8ba9\u5b83\u6d88\u5931\u3002<\/p>\n
licunchun \u60f3\u77e5\u9053\u6240\u9700\u8981\u7684\u6700\u5c11\u6b21\u6570\u3002<\/p>\n
licunchun \u51a5\u601d\u82e6\u60f3\u4e861145141919810\u90fd\u6ca1\u6709\u60f3\u51fa\u6765\uff0c\u4e8e\u662f\u628a\u95ee\u9898\u4ea4\u7ed9\u4e86\u4f60\u3002<\/p>\n
<\/a>\u8f93\u5165<\/h5>\n
\u7b2c\u4e00\u884c\u8f93\u5165T\uff0c\u8868\u793a\u6570\u636e\u7ec4\u6570<\/p>\n
\u5bf9\u4e8e\u6bcf\u7ec4\u6570\u636e\uff1a<\/p>\n
\u7b2c\u4e00\u884c\u7ed9\u5b9a\u4e00\u4e2an\uff0c\u8868\u793a\u7167\u7247\u7684\u957f\u5ea6\u3002<\/p>\n
\u7b2c\u4e8c\u884c\uff0c\u7ed9\u5b9a\u4e00\u4e32s\uff0c\u7528\u6765\u63cf\u8ff0\u8fd9\u4e2a\u7167\u7247\u7684\u989c\u8272\u3002\u4e3a\u4e86\u65b9\u4fbf\uff0c\u989c\u8272\u7684\u63cf\u8ff0\u7edf\u4e00\u7528\u5c0f\u5199\u5b57\u6bcd\uff0c\u4e00\u79cd\u5b57\u6bcd\u8868\u793a\u4e00\u79cd\u989c\u8272\u3002<\/p>\n
<\/a>\u8f93\u51fa<\/h5>\n
\u5bf9\u4e8e\u6bcf\u7ec4\u6570\u636eT\uff0c\u4e00\u884c\u8f93\u51fa\u4e00\u4e2a\u6570\u5b57\uff0c\u8868\u793a\u6240\u9700\u8981\u7684\u6700\u5c11\u6b21\u6570\u3002<\/p>\n
<\/a>\u6837\u4f8b\u8f93\u5165<\/h5>\n
3\n5\nabaca\n8\nabcddcba\n7\nlggmmro\n<\/code><\/pre>\n
<\/a>\u6837\u4f8b\u8f93\u51fa<\/h5>\n
3\n4\n5\n<\/code><\/pre>\n
<\/a>\u63d0\u793a<\/h5>\n
\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"
 \u52a8\u6001\u89c4\u5212\uff0cdp[i][j]\u4ee3\u8868\u4ee5i\u4e3a\u5f00\u5934\u957f\u5ea6\u4e3aj\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570\uff0c\u6700\u540edp[1][n]\u5373\u4e3a\u7b54\u6848\u3002<\/p>\n
#pragma<\/span> GCC optimize(1)<\/span>\n#pragma<\/span> GCC optimize(2)<\/span>\n#pragma<\/span> GCC optimize(3,\"Ofast\",\"inline\")<\/span>\n#include<\/span> <\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\ntypedef<\/span> long<\/span> long<\/span> ll;<\/span>\nint<\/span> dp[<\/span>600<\/span>]<\/span>[<\/span>600<\/span>]<\/span>=<\/span> {<\/span>0<\/span>}<\/span>;<\/span>\nchar<\/span> a[<\/span>600<\/span>]<\/span>=<\/span>\"\"<\/span>;<\/span>\nconst<\/span> int<\/span> inf=<\/span>0x3f3f3f<\/span>;<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    int<\/span> t;<\/span>\n    scanf<\/span>(<\/span>\"%d\"<\/span>,<\/span>&<\/span>t)<\/span>;<\/span>\n    while<\/span>(<\/span>t--<\/span>)<\/span>\n    {<\/span>\n        memset<\/span>(<\/span>dp,<\/span>inf,<\/span>sizeof<\/span>(<\/span>dp)<\/span>)<\/span>;<\/span>\n        int<\/span> n;<\/span>\n        scanf<\/span>(<\/span>\"%d\"<\/span>,<\/span>&<\/span>n)<\/span>;<\/span>\n        scanf<\/span>(<\/span>\"%s\"<\/span>,<\/span>a+<\/span>1<\/span>)<\/span>;<\/span>\n        for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span> i<=<\/span>n;<\/span> i++<\/span>)<\/span>\n            dp[<\/span>i]<\/span>[<\/span>1<\/span>]<\/span>=<\/span>1<\/span>;<\/span>\n        for<\/span>(<\/span>int<\/span> i=<\/span>2<\/span>;<\/span> i<=<\/span>n;<\/span> i++<\/span>)<\/span>\n        {<\/span>\n            for<\/span>(<\/span>int<\/span> j=<\/span>1<\/span>;<\/span> j<=<\/span>n-<\/span>i+<\/span>1<\/span>;<\/span> j++<\/span>)<\/span>\n            {<\/span>\n                if<\/span>(<\/span>a[<\/span>j]<\/span>==<\/span>a[<\/span>i+<\/span>j-<\/span>1<\/span>]<\/span>)<\/span>\n                {<\/span>\n                    dp[<\/span>j]<\/span>[<\/span>i]<\/span>=<\/span>min<\/span>(<\/span>dp[<\/span>j]<\/span>[<\/span>i-<\/span>1<\/span>]<\/span>,<\/span>dp[<\/span>j+<\/span>1<\/span>]<\/span>[<\/span>i-<\/span>1<\/span>]<\/span>)<\/span>;<\/span>\n                }<\/span>\n                else<\/span>\n                {<\/span>\n                    dp[<\/span>j]<\/span>[<\/span>i]<\/span>=<\/span>min<\/span>(<\/span>dp[<\/span>j]<\/span>[<\/span>i-<\/span>1<\/span>]<\/span>,<\/span>dp[<\/span>j+<\/span>1<\/span>]<\/span>[<\/span>i-<\/span>1<\/span>]<\/span>)<\/span>+<\/span>1<\/span>;<\/span>\n                }<\/span>\n                for<\/span>(<\/span>int<\/span> k=<\/span>1<\/span>;<\/span>k<=<\/span>i;<\/span>k++<\/span>)<\/span>\n                {<\/span>\n                    dp[<\/span>j]<\/span>[<\/span>i]<\/span>=<\/span>min<\/span>(<\/span>dp[<\/span>j]<\/span>[<\/span>i]<\/span>,<\/span>dp[<\/span>j]<\/span>[<\/span>k]<\/span>+<\/span>dp[<\/span>j+<\/span>k]<\/span>[<\/span>i-<\/span>k]<\/span>)<\/span>;<\/span>\n                }<\/span>\n            }<\/span>\n        }<\/span>\n        cout<<<\/span>dp[<\/span>1<\/span>]<\/span>[<\/span>n]<\/span><<<\/span>endl;<\/span>\n    }<\/span>\n    return<\/span> 0<\/span>;<\/span>\n}<\/span>\n<\/code><\/pre>\n
<\/a>\u9898\u76ee\u63cf\u8ff0<\/h5>\n
\u795e\u4ed9\u59d0\u59d0\u9047\u5230\u4e00\u4e2a\u96be\u9898\uff1a
 \u6709\u5b9d\u85cf\u51fa\u73b0\u5728\u59d0\u59d0\u9762\u524d\u540e\uff0c\u53c8\u51fa\u73b0\u4e00\u884c\u5b57\u8bf4\u201c\u8fd9\u91cc\u7684\u5404\u79cd\u7c7b\u578b\u7684\u5b9d\u7269\u662f\u653e\u5728\u957f\u65b9\u5f62\u7684\u77f3\u684c\u4e0a\uff0c\u4f60\u53ea\u80fd\u4e00\u6b21\u6027\u62ff\u8d70\u540c\u4e00\u79cd\u7c7b\u578b\u7684\u5b9d\u7269\uff0c\u5e76\u4e14\u8981\u6c42\u4f60\u62ff\u8d70\u7684\u5b9d\u7269\u5fc5\u987b\u4e3a\u67d0\u4e2a\u6b63\u65b9\u5f62\u5b50\u77e9\u9635\u4e2d\u67d0\u6761\u5bf9\u89d2\u7ebf\uff0c\u800c\u4e14\u6b64\u65f6\uff0c\u4f60\u6240\u9009\u62e9\u7684\u8fd9\u4e2a\u6b63\u65b9\u5f62\u5b50\u77e9\u9635\u4e2d\uff0c\u9664\u4e86\u5bf9\u89d2\u7ebf\u4f4d\u7f6e\uff0c\u5176\u5b83\u4f4d\u7f6e\u4e0d\u80fd\u51fa\u73b0\u4f60\u6240\u9700\u8981\u7684\u5b9d\u7269\u7c7b\u578b\uff08\u56e0\u4e3a\u8fd9\u6837\u4f1a\u5206\u5fc3\uff09\uff01\u4f60\u53ef\u4ee5\u628a\u77f3\u684c\u89c6\u4e3a01\u77e9\u9635\uff080\u8868\u793a\u5bf9\u5e94\u4f4d\u7f6e\u4e0d\u662f\u4f60\u6240\u8981\u7684\u7c7b\u578b\uff0c1\u8868\u793a\u5bf9\u5e94\u4f4d\u7f6e\u6709\u4f60\u6240\u8981\u7684\u7c7b\u578b\uff0c\u8fd9\u6837\u6709\u52a9\u4e8e\u4f60\u591a\u62ff\u4e9b\u5b9d\u7269\uff09\u201d\u3002
 \u5f53\u7136\u7231\u7f8e\u7684\u59d0\u59d0\u9009\u62e9\u7684\u662f\u53ef\u4ee5\u7f8e\u5bb9\u517b\u989c\u7c7b\u578b\u7684\uff0c\u6240\u4ee5\u5979\u628a\u6240\u60f3\u8981\u7684\u5b9d\u7269(\u5373\u7f8e\u5bb9\u6c34)\u7528\uff11\u8868\u793a\uff0c\u4e0d\u60f3\u8981\u7684\u5c31\u75280\u8868\u793a\u3002\u540c\u65f6\u59d0\u59d0\u662f\u4e2a\u5f88\u8d2a\u5a6a(\u8d2a\u7f8e)\u7684\u795e\u4ed9\uff0c\u6240\u4ee5\u5979\u60f3\u4e00\u4e0b\u62ff\u8d70\u5c3d\u91cf\u591a\u7684\u5979\u6240\u8981\u7684\u7f8e\u5bb9\u54c1\u3002\u8bf7\u4f60\u5e2e\u795e\u4ed9\u59d0\u59d0\u7b97\u4e00\u4e0b\uff0c\u5979\u4e00\u4e0b\u6700\u591a\u53ef\u4ee5\u62ff\u591a\u5c11\u4e2a\uff1f<\/p>\n
<\/a>\u8f93\u5165<\/h5>\n
\u7b2c\u4e00\u884c\u6709\u4e24\u4e2a\u6574\u6570n\u548cm\uff08n\uff0cm\u22651\uff09\uff0c\u63cf\u8ff0\u77f3\u684c\u7684\u89c4\u6a21\u3002\u63a5\u4e0b\u6765\u7684n\u884c\uff0c\u6bcf\u884c\u6709m\u4e2a\u6570\u5b57\uff08\u975e\u201c0\u201d\u5373\u201c1\u201d\uff09\u3002\u6bcf\u4e24\u4e2a\u6570\u5b57\u4e4b\u95f4\u7528\u7a7a\u683c\u9694\u5f00\u3002<\/p>\n
<\/a>\u8f93\u51fa<\/h5>\n
\u53ea\u6709\u4e00\u4e2a\u6574\u6570\u2014\u2014\u795e\u4ed9\u4e00\u4e0b\u6700\u591a\u53ef\u4ee5\u62ff\u5230\u591a\u5c11\u4e2a\u5b9d\u7269\uff0c\u5360\u4e00\u884c\uff0c\u884c\u672b\u6709\u56de\u8f66\u3002<\/p>\n
<\/a>\u6837\u4f8b\u8f93\u5165<\/h5>\n
4 6\n0 1 0 1 0 0\n0 0 1 0 1 0\n1 1 0 0 0 1\n0 1 1 0 1 0\n<\/code><\/pre>\n
<\/a>\u6837\u4f8b\u8f93\u51fa<\/h5>\n
3\n<\/code><\/pre>\n
<\/a>\u63d0\u793a<\/h5>\n
\u5bf9\u4e8e100%\u7684\u6570\u636e\uff0c\u6709n\uff0cm\u22642500
 \u4e8c\u7ef4\u524d\u7f00\u548c<\/p>\n
#pragma<\/span> GCC optimize(1)<\/span>\n#pragma<\/span> GCC optimize(2)<\/span>\n#pragma<\/span> GCC optimize(3,\"Ofast\",\"inline\")<\/span>\n#include<\/span> <\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\n \nint<\/span> a[<\/span>2550<\/span>]<\/span>[<\/span>2550<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nint<\/span> d[<\/span>2550<\/span>]<\/span>[<\/span>2550<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    int<\/span> n,<\/span>m;<\/span>\n    scanf<\/span>(<\/span>\"%d%d\"<\/span>,<\/span>&<\/span>n,<\/span>&<\/span>m)<\/span>;<\/span>\n    for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span> i<=<\/span>n;<\/span> i++<\/span>)<\/span>\n    {<\/span>\n        for<\/span>(<\/span>int<\/span> j=<\/span>1<\/span>;<\/span> j<=<\/span>m;<\/span> j++<\/span>)<\/span>\n        {<\/span>\n            scanf<\/span>(<\/span>\"%d\"<\/span>,<\/span>&<\/span>a[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span>;<\/span>\n            d[<\/span>i]<\/span>[<\/span>j]<\/span>=<\/span>d[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j]<\/span>+<\/span>d[<\/span>i]<\/span>[<\/span>j-<\/span>1<\/span>]<\/span>-<\/span>d[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j-<\/span>1<\/span>]<\/span>+<\/span>a[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/span>\n        }<\/span>\n    }<\/span>\n    int<\/span> max1=<\/span>0<\/span>;<\/span>\n    for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span> i<=<\/span>n;<\/span> i++<\/span>)<\/span>\n    {<\/span>\n        for<\/span>(<\/span>int<\/span> j=<\/span>1<\/span>;<\/span> j<=<\/span>m;<\/span> j++<\/span>)<\/span>\n        {<\/span>\n            int<\/span> cnt=<\/span>0<\/span>;<\/span>\n            while<\/span>(<\/span>i+<\/span>cnt<=<\/span>n&&<\/span>j+<\/span>cnt<=<\/span>m&&<\/span>a[<\/span>i]<\/span>[<\/span>j]<\/span>&&<\/span>a[<\/span>i+<\/span>cnt]<\/span>[<\/span>j+<\/span>cnt]<\/span>)<\/span>\n            {<\/span>\n                int<\/span> k1=<\/span>d[<\/span>i+<\/span>cnt]<\/span>[<\/span>j+<\/span>cnt]<\/span>-<\/span>d[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j+<\/span>cnt]<\/span>-<\/span>d[<\/span>i+<\/span>cnt]<\/span>[<\/span>j-<\/span>1<\/span>]<\/span>+<\/span>d[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j-<\/span>1<\/span>]<\/span>;<\/span>\n                int<\/span> k2=<\/span>d[<\/span>i+<\/span>cnt-<\/span>1<\/span>]<\/span>[<\/span>j+<\/span>cnt-<\/span>1<\/span>]<\/span>-<\/span>d[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j+<\/span>cnt-<\/span>1<\/span>]<\/span>-<\/span>d[<\/span>i+<\/span>cnt-<\/span>1<\/span>]<\/span>[<\/span>j-<\/span>1<\/span>]<\/span>+<\/span>d[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j-<\/span>1<\/span>]<\/span>;<\/span>\n                if<\/span>(<\/span>k1==<\/span>cnt+<\/span>1<\/span>&&<\/span>k1-<\/span>k2==<\/span>1<\/span>)<\/span>\n                {<\/span>\n                    max1=<\/span>max<\/span>(<\/span>max1,<\/span>cnt+<\/span>1<\/span>)<\/span>;<\/span>\n                    cnt++<\/span>;<\/span>\n                }<\/span>\n                else<\/span>\n                    break<\/span>;<\/span>\n            }<\/span>\n            cnt=<\/span>0<\/span>;<\/span>\n            while<\/span>(<\/span>i+<\/span>cnt<=<\/span>n&&<\/span>j-<\/span>cnt>=<\/span>1<\/span>&&<\/span>a[<\/span>i]<\/span>[<\/span>j]<\/span>&&<\/span>a[<\/span>i+<\/span>cnt]<\/span>[<\/span>j-<\/span>cnt]<\/span>)<\/span>\n            {<\/span>\n                int<\/span> k1=<\/span>d[<\/span>i+<\/span>cnt]<\/span>[<\/span>j]<\/span>-<\/span>d[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j]<\/span>-<\/span>d[<\/span>i+<\/span>cnt]<\/span>[<\/span>j-<\/span>cnt-<\/span>1<\/span>]<\/span>+<\/span>d[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j-<\/span>1<\/span>-<\/span>cnt]<\/span>;<\/span>\n                int<\/span> k2=<\/span>d[<\/span>i+<\/span>cnt-<\/span>1<\/span>]<\/span>[<\/span>j]<\/span>-<\/span>d[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j]<\/span>-<\/span>d[<\/span>i+<\/span>cnt-<\/span>1<\/span>]<\/span>[<\/span>j-<\/span>cnt]<\/span>+<\/span>d[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j-<\/span>cnt]<\/span>;<\/span>\n                if<\/span>(<\/span>k1==<\/span>cnt+<\/span>1<\/span>&&<\/span>k1-<\/span>k2==<\/span>1<\/span>)<\/span>\n                {<\/span>\n                    max1=<\/span>max<\/span>(<\/span>max1,<\/span>cnt+<\/span>1<\/span>)<\/span>;<\/span>\n                    cnt++<\/span>;<\/span>\n                }<\/span>\n                else<\/span>\n                    break<\/span>;<\/span>\n            }<\/span>\n        }<\/span>\n    }<\/span>\n    cout<<<\/span>max1<<<\/span>endl;<\/span>\n    return<\/span> 0<\/span>;<\/span>\n}<\/span>\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
http:\/\/icpc.upc.edu.cn\/pr…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-44","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts\/44","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/comments?post=44"}],"version-history":[{"count":0,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts\/44\/revisions"}],"wp:attachment":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/media?parent=44"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/categories?post=44"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/tags?post=44"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
http:\/\/icpc.upc.edu.cn\/problem.php?cid=2512&pid=2<\/a><\/p>\n
http:\/\/icpc.upc.edu.cn\/problem.php?cid=2512&pid=6<\/a><\/p>\n
http:\/\/icpc.upc.edu.cn\/problem.php?cid=2512&pid=4<\/a><\/p>\n