上海网站设计哪家强,wordpress腾讯云CDN配置,河北建设网查询中心,搜索优化排名前言
我好菜我好菜我好菜我好菜我好菜 我好菜我好菜我好菜我好菜我好菜 我好菜我好菜我好菜我好菜我好菜 我好菜我好菜我好菜我好菜我好菜 我好菜我好菜我好菜我好菜我好菜 我好菜我好菜我好菜我好菜我好菜 心态大崩 ZYCdalaoZYCdalaoZYCdalao去AKBAK\ BAK B组了所以应该是我垫…前言
我好菜我好菜我好菜我好菜我好菜 我好菜我好菜我好菜我好菜我好菜 我好菜我好菜我好菜我好菜我好菜 我好菜我好菜我好菜我好菜我好菜 我好菜我好菜我好菜我好菜我好菜 我好菜我好菜我好菜我好菜我好菜 心态大崩
ZYCdalaoZYCdalaoZYCdalao去AKBAK\ BAK B组了所以应该是我垫底了 话说今天好多暴力都可以ACACAC的题目而我还在死刚正解以后还是得注意了 成绩
JJJ表示初中HHH表示高中后面加的是几年级
RankRankRankPersonPersonPersonScoreScoreScoreAAABBBCCC333(J−3)ZZY(J-3)ZZY(J−3)ZZY263263263100100100100100100636363151515(J−3)WHF(J-3)WHF(J−3)WHF140140140404040100100100000272727(J−2)LRZ(J-2)LRZ(J−2)LRZ100100100100100100000000343434(J−2)XJQ(J-2)XJQ(J−2)XJQ858585858585000000404040(J−3)QYH(J-3)QYH(J−3)QYH727272434343242424555424242(J−2)XXY(J-2)XXY(J−2)XXY666666555555000111111545454(J−2)LW(J-2)LW(J−2)LW333333333333000000585858(J−2)HJQ(J-2)HJQ(J−2)HJQ262626000262626000616161(J−2)HZB(J-2)HZB(J−2)HZB202020202020000000646464(J−2)WYC(J-2)WYC(J−2)WYC777000777000656565(J−2)ZYC(J-2)ZYC(J−2)ZYC666666000000正题 T1:jzoj3337−[NOI2013T1:jzoj3337-[NOI2013T1:jzoj3337−[NOI2013模拟]wyl8899]wyl8899]wyl8899的TLETLETLE【字符串hash,hash,hash,二分】
链接: https://blog.csdn.net/Mr_wuyongcong/article/details/95209417 T2:jzoj3338−[NOI2013T2:jzoj3338-[NOI2013T2:jzoj3338−[NOI2013模拟]]]法法塔的奖励【权值线段树,,,线段树合并】
链接: https://blog.csdn.net/Mr_wuyongcong/article/details/95209896 T3:jzoj3339−[NOI2013T3:jzoj3339-[NOI2013T3:jzoj3339−[NOI2013模拟]wyl8899]wyl8899]wyl8899和法法塔的游戏【博弈论,,,暴力】
链接: https://blog.csdn.net/Mr_wuyongcong/article/details/95210406 someofcodesome\ of\ codesome of code T27T2\ 7T2 7分codecodecode
#includecstdio
#includecstring
#includealgorithm
#includevector
using namespace std;
const int N101000;
int n,tot,ls[N],w[N],num[N],maxs[N],seg[N],cnt;
int ans[N],tail,siz[N],son[N],p[N],id[N],ed[N];
struct Edge_node{int to,next;
}a[N*2];
struct Tree_node{int w,l,r,c;
};
vectorint q[N],c[N];
struct Line_cut_tree{Tree_node t[N2];void megre(Tree_node t,Tree_node tl,Tree_node tr){t.wtl.wtr.w;t.cmax(tl.c,tr.c);}void build(int x,int l,int r){t[x].ll;t[x].rr;if(lr){t[x].w0;t[x].c0;return;}int mid(lr)/2;build(x*2,l,mid);build(x*21,mid1,r);megre(t[x],t[x*2],t[x*21]);}int Ask(int x,int l,int r){if(t[x].llt[x].rr)return t[x].c;if(rt[x*2].r) return Ask(x*2,l,r);else if(lt[x*2].r) return Ask(x*21,l,r);else return max(Ask(x*2,l,t[x*2].r),Ask(x*21,t[x*21].l,r));}void Change(int x,int pos,int z){if(t[x].lt[x].r){t[x].w;t[x].cz;return;}if(post[x*2].r) Change(x*2,pos,z);else if(post[x*2].r) Change(x*21,pos,z);megre(t[x],t[x*2],t[x*21]);}
}Tree;
void addl(int x,int y)
{a[tot].toy;a[tot].nextls[x];ls[x]tot;
}
void ycl(int x)
{siz[x]1;for(int ils[x];i;ia[i].next){int ya[i].to;ycl(y);siz[x]siz[y];if(siz[y]siz[son[x]]) son[x]y;}
}
void dfs(int x,int top)
{if(!son[x]){ans[x]1;if(top!x)Tree.Change(1,w[x],1);return;}id[x]cnt;seg[cnt]x;for(int ils[x];i;ia[i].next){int ya[i].to;if(yson[x]) continue;dfs(y,y);}int midcnt;dfs(son[x],x);for(int iid[x]1;imid;ied[seg[i]]1){for(int ji;jed[seg[i]];j){int zmax(Tree.Ask(1,1,w[seg[j]]),ans[seg[j]]);Tree.Change(1,w[seg[j]],z);}}int zTree.Ask(1,1,w[x]);ans[x]z1;Tree.Change(1,w[x],z1);ed[x]cnt;if(topx)for(int iid[x];ied[x];i)Tree.Change(1,w[seg[i]],ans[seg[i]]-1);
}
int main()
{scanf(%d,n);Tree.build(1,1,n);for(int i1;in;i){int x;scanf(%d,x);if(i1) continue;addl(x,i);}for(int i1;in;i)scanf(%d,w[i]);ycl(1);dfs(1,1);for(int i1;in;i)printf(%d ,ans[i]);
}总结
很烦不想写 -_-\color{darkblue}\texttt{-\_-}-_-
最后的最后 ❤这使你充满了决心\color{red}\begin{matrix}\huge{❤} \end{matrix}\color{white}\\\texttt{这使你充满了决心}❤这使你充满了决心
