\u4f17\u6240\u5468\u77e5\uff0c\u5706\u65b9\u6811\u662f\u7528\u6765\u5904\u7406\u56fe\u4e0a\u70b9\u53cc\u76f8\u5173\u95ee\u9898\u7684\u3002
\n\u540c\u65f6\uff0c\u70b9\u53cc\u53c8\u662f\u4e00\u4e2a\u548c\u7b80\u5355\u8def\u5f84\u5bc6\u5207\u76f8\u5173\u7684\u4e1c\u897f\u3002\u6545\u800c\u8fd9\u4e00\u9898\u6211\u4eec\u53ef\u4ee5\u8003\u8651\u7528\u5706\u65b9\u6811\u6765\u5904\u7406\u3002
\n\u6211\u4eec\u53d1\u73b0\uff0c\u5982\u679c\u4e24\u70b9\u4e4b\u95f4\u6709\u591a\u6761\u7b80\u5355\u8def\u5f84\uff0c\u90a3\u4e48\u5b83\u4eec\u4e00\u5b9a\u5904\u4e8e\u540c\u4e00\u4e2a\u70b9\u53cc\u4e2d\u3002\u6240\u4ee5\uff0c\u6211\u4eec\u53ef\u4ee5\u628a\u539f\u56fe\u8f6c\u5316\u4e3a\u5706\u65b9\u6811\uff0c\u8fd9\u6837\u5c31\u53ef\u4ee5\u7528\u6811\u94fe\u5256\u5206\u5957\u7ebf\u6bb5\u6811\u6765\u6c42\u89e3\u8be2\u95ee\u4e86\u3002
\n\u4f46\u662f\u9898\u76ee\u8981\u6c42\u8981\u4fee\u6539\u70b9\u6743\uff0c\u8fd9\u8981\u600e\u4e48\u529e\u5462\uff1f <\/p>\n\n\n\n
\u4e00\u4e2a\u76f4\u89c2\u7684\u60f3\u6cd5\u662f\u66b4\u529b\u4fee\u6539\u6bcf\u4e2a\u70b9\u5468\u56f4\u76f8\u90bb\u7684\u65b9\u70b9\u3002\u7136\u800c\u4e8b\u5b9e\u4e0a\u5982\u679c\u51fa\u73b0\u4e86\u4e2a\u83ca\u82b1\u5957\u83ca\u82b1\u5957\u83ca\u82b1\u56fe\u7684\u8bdd\u663e\u7136\u662f\u4f1a\u4e25\u91cdTLE\u7684\u3002
\n\u6211\u4eec\u8003\u8651\u4e00\u79cd\u52a8\u6001\u7ef4\u62a4\u4e00\u4e2a\u65b9\u70b9\u7684\u70b9\u503c\u7684\u7b97\u6cd5\u3002\u6211\u4eec\u5c1d\u8bd5\u5bf9\u6bcf\u4e2a\u65b9\u70b9\u5f00\u4e00\u4e2amulitiset\uff0c\u6bcf\u5f53\u4fee\u6539\u4e00\u4e2a\u70b9\u7684\u70b9\u6743\u7684\u65f6\u5019\u5c31\u628a\u65e7\u7684\u70b9\u6743\u5220\u53bb\u7136\u540e\u63d2\u5165\u65b0\u7684\u70b9\u6743\uff0c\u5e76\u66f4\u65b0\u65b9\u70b9\u70b9\u503c\u3002
\n\u7136\u800c\uff0c\u5982\u679c\u6bcf\u4e2a\u4fee\u6539\u7684\u5706\u70b9\u5468\u56f4\u90fd\u6709\u5f88\u591a\u7684\u65b9\u70b9\u7684\u8bdd\uff0c\u8fd9\u79cd\u505a\u6cd5\u4ecd\u7136\u6709TLE\u7684\u98ce\u9669\u3002\u6211\u4eec\u8003\u8651\u5bf9\u4e8e\u6bcf\u4e2a\u5706\u70b9\uff0c\u53ea\u66f4\u65b0\u5b83\u7684\u7236\u4eb2\u65b9\u70b9\u3002
\n\u5b83\u5bf9\u5b83\u7684\u513f\u5b50\u65b9\u70b9\u7684\u8d21\u732e\uff0c\u5219\u5728\u8be2\u95ee\u7684\u65f6\u5019\u7edf\u8ba1\u3002
\n\u8fd9\u6837\u590d\u6742\u5ea6\u5c31\u5bf9\u4e86\u3002
\n\u8fd9\u5c31\u4f7f\u7528\u4e86\u5706\u65b9\u6811\u4e0a\u6811\u94fe\u5256\u5206\u5957\u7ebf\u6bb5\u6811\u89e3\u51b3\u4e86\u8fd9\u9053\u9898\u3002 <\/p>\n\n\n\n
\u6ce8\u610f\uff1a
\n\u6811\u94fe\u5256\u5206\u4e2d\u66f4\u65b0\u6700\u5927\u5b69\u5b50\u7684\u90e8\u5206\uff0c\u8fd9\u91cc\u662fson\uff01\u4e0d\u662fsz\uff01\u8c03\u4e86\u6211\u4e00\u4e2a\u665a\u4e0a\uff01 <\/p>\n\n\n\n
#pragma GCC optimize(\"Ofast\")\n#include<iostream>\n#include<cstdio>\n#include<algorithm> \n#include<set>\n#define Fv(H,A,X) for(int A=H[X];A;A=e[A].nxt)\n\nstd::multiset<int> s[200005]; \n\nconst int INF=2147483647;\n\ninline int Max(int A,int B){\n\treturn A>B?A:B;\n}\ninline int Min(int A,int B){\n\treturn A<B?A:B;\n}\ninline void Swap(int &A,int &B){\n\tA^=B^=A^=B;\n}\n\nstruct ee{\n\tint v;\n\tint nxt;\n}e[2000005];\nint h0[100005],h[200005],et=0;\ninline void Eadd(int *H,int U,int V){\n\te[++et]=(ee){V,H[U]};\n\tH[U]=et;\n}\ninline void add(int *H,int U,int V){\n\tEadd(H,U,V);\n\tEadd(H,V,U);\n}\n\n\nint dfn[200005],lw[100005];\n\/\/\u6ce8\u610f\u6570\u7ec4\u5927\u5c0f\u3002 \nint nm,cnt=0;\nint st[100005],tp=0;\ninline void dfs0(int X){\n\tdfn[X]=lw[X]=++cnt;\n\tst[++tp]=X;\n\tFv(h0,i,X){\n\t\tif(!dfn[e[i].v]){\n\t\t\tdfs0(e[i].v);\n\t\t\tlw[X]=Min(lw[X],lw[e[i].v]);\n\t\t\tif(lw[e[i].v]==dfn[X]){\n\t\t\t\t++nm;\n\t\t\t\tfor(int j=0;j!=e[i].v;--tp){\n\t\t\t\t\tj=st[tp];\n\t\t\t\t\tadd(h,nm,j);\n\t\t\t\t}\n\t\t\t\tadd(h,X,nm);\n\t\t\t}\n\t\t}else{\n\t\t\tlw[X]=Min(lw[X],dfn[e[i].v]);\n\t\t}\n\t}\n}\nint fa[200005],sz[200005],dep[200005],son[200005],top[200005],loc[200005];\ninline void dfs1(int X,int FA){\n\tfa[X]=FA,dep[X]=dep[FA]+1,sz[X]=1;\n\tFv(h,i,X){\n\t\tif(e[i].v!=FA){\n\t\t\tdfs1(e[i].v,X);\n\t\t\tsz[X]+=sz[e[i].v];\n\t\t\tif(sz[son[X]]<sz[e[i].v]){\n\t\t\t\tson[X]=e[i].v;\n\t\t\t\t\/\/\u8fd9\u91cc\u662fson\uff01\u4e0d\u662fsz\uff01\u8c03\u4e86\u6211\u4e00\u4e2a\u665a\u4e0a\uff01 \n\t\t\t}\n\t\t}\n\t}\n}\ninline void dfs2(int X,int FA,int TP){\n\tdfn[X]=++cnt,loc[cnt]=X,top[X]=TP;\n\tif(son[X]){\n\t\tdfs2(son[X],X,TP);\n\t}\n\tFv(h,i,X){\n\t\tif(e[i].v!=FA&&e[i].v!=son[X]){\n\t\t\tdfs2(e[i].v,X,e[i].v);\n\t\t}\n\t}\n}\n\nint n,m,q;\nint a[200005];\n\n#define MID (L+R>>1)\n#define LS (X<<1)\n#define RS (X<<1|1)\n\nint tr[600005];\ninline void bld(int X,int L,int R){\n\tif(L==R){\n\t\ttr[X]=a[loc[L]];\n\/\/\t\t\u8bb0\u5f97\u9006\u54c8\u5e0c \n\t\treturn;\n\t}\n\tbld(LS,L,MID);\n\tbld(RS,MID+1,R);\n\ttr[X]=Min(tr[LS],tr[RS]);\n}\n\ninline void chg(int X,int L,int R,int P,int V){\n\tif(L==R){\n\t\ttr[X]=V;\n\t\treturn;\n\t}\n\tP<=MID?chg(LS,L,MID,P,V):chg(RS,MID+1,R,P,V);\n\ttr[X]=Min(tr[LS],tr[RS]);\n}\n\ninline int qry(int X,int L,int R,int A,int B){\n\tif(A>R||L>B){\n\t\treturn INF;\n\t}\n\tif(A<=L&&R<=B){\n\t\treturn tr[X];\n\t}\n\treturn Min(qry(LS,L,MID,A,B),qry(RS,MID+1,R,A,B));\n}\n\nvoid init(){\n\tscanf(\"%d%d%d\",&n,&m,&q);\n\tnm=n;\n\tfor(int i=1;i<=n;++i){\n\t\tscanf(\"%d\",&a[i]);\n\t}\n\tint u,v;\n\tfor(int i=1;i<=m;++i){\n\t\tscanf(\"%d%d\",&u,&v);\n\t\tadd(h0,u,v);\n\t}\n\tdfs0(1);\n\tdfs1(1,0);\n\tcnt=0;\n\tdfs2(1,0,1);\n\tfor(int i=1;i<=n;++i){\n\t\tif(fa[i]){\n\t\t\ts[fa[i]].insert(a[i]);\n\t\t}\n\t}\n\tfor(int i=n+1;i<=nm;++i){\n\t\ta[i]=*s[i].begin();\n\t}\n\t\n\tbld(1,1,nm);\n\tchar ch[3];\n\tint x,y;\n\tint ans;\n\t\n\tfor(int i=1;i<=q;++i){\n\t\tscanf(\"%s%d%d\",ch,&x,&y);\n\t\tif(ch[0]=='C'){\n\t\t\tchg(1,1,nm,dfn[x],y);\n\t\t\tif(fa[x]){\n\t\t\t\tu=fa[x];\n\t\t\t\ts[u].erase(s[u].lower_bound(a[x]));\n\t\t\t\ts[u].insert(y);\n\t\t\t\tif(a[u]!=*s[u].begin()){\n\t\t\t\t\ta[u]=*s[u].begin();\n\t\t\t\t\tchg(1,1,nm,dfn[u],a[u]);\n\t\t\t\t}\n\t\t\t}\n\t\t\ta[x]=y;\n\t\t}else{\n\t\t\tans=INF;\n\t\t\twhile(top[x]!=top[y]){\n\t\t\t\tif(dep[top[x]]<dep[top[y]]){\n\t\t\t\t\tSwap(x,y);\n\t\t\t\t}\n\t\t\t\tans=Min(ans,qry(1,1,nm,dfn[top[x]],dfn[x]));\n\t\t\t\tx=fa[top[x]];\n\t\t\t}\n\t\t\tif(dfn[x]>dfn[y]){\n\t\t\t\tSwap(x,y);\n\t\t\t}\n\t\t\tans=Min(ans,qry(1,1,nm,dfn[x],dfn[y]));\n\t\t\tif(x>n){\n\t\t\t\tans=Min(ans,a[fa[x]]);\n\t\t\t}\n\t\t\tprintf(\"%d\\n\",ans);\n\t\t}\n\t} \n}\n\nint main(){\n\tinit();\n\treturn 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"\u4f17\u6240\u5468\u77e5\uff0c\u5706\u65b9\u6811\u662f\u7528\u6765\u5904\u7406\u56fe\u4e0a\u70b9\u53cc\u76f8\u5173\u95ee\u9898\u7684\u3002 \u540c\u65f6\uff0c\u70b9\u53cc\u53c8\u662f\u4e00\u4e2a\u548c\u7b80\u5355\u8def\u5f84\u5bc6\u5207\u76f8\u5173\u7684\u4e1c\u897f\u3002\u6545\u800c\u8fd9\u4e00\u9898\u6211\u4eec\u53ef\u4ee5 … <\/p>\n