前言

我好菜我好菜我好菜我好菜我好菜
我好菜我好菜我好菜我好菜我好菜
我好菜我好菜我好菜我好菜我好菜
我好菜我好菜我好菜我好菜我好菜
我好菜我好菜我好菜我好菜我好菜
我好菜我好菜我好菜我好菜我好菜
心態(tài)大崩

$ZYCdalao$去$AKB$組了所以應(yīng)該是我墊底了
話說今天好多暴力都可以$AC$的題目而我還在死剛正解，以后還是得注意了

---

成績

$J$表示初中，$H$表示高中后面加的是幾年級

$Rank$$Person$$Score$$A$$B$$C$

$3$	$(J?3)ZZY$	$263$	$100$	$100$	$63$
$15$	$(J?3)WHF$	$140$	$40$	$100$	$0$
$27$	$(J?2)LRZ$	$100$	$100$	$0$	$0$
$34$	$(J?2)XJQ$	$85$	$85$	$0$	$0$
$40$	$(J?3)QYH$	$72$	$43$	$24$	$5$
$42$	$(J?2)XXY$	$66$	$55$	$0$	$11$
$54$	$(J?2)LW$	$33$	$33$	$0$	$0$
$58$	$(J?2)HJQ$	$26$	$0$	$26$	$0$
$61$	$(J?2)HZB$	$20$	$20$	$0$	$0$
$64$	$(J?2)WYC$	$7$	$0$	$7$	$0$
$65$	$(J?2)ZYC$	$6$	$6$	$0$	$0$

---

正題

---

$T1:jzoj3337?[NOI2013$模擬$]wyl8899$的$TLE$【字符串$hash,$二分】

鏈接:
https://blog.csdn.net/Mr_wuyongcong/article/details/95209417

---

$T2:jzoj3338?[NOI2013$模擬$]$法法塔的獎勵【權(quán)值線段樹$,$線段樹合并】

鏈接:
https://blog.csdn.net/Mr_wuyongcong/article/details/95209896

---

$T3:jzoj3339?[NOI2013$模擬$]wyl8899$和法法塔的游戲【博弈論$,$暴力】

鏈接:
https://blog.csdn.net/Mr_wuyongcong/article/details/95210406

---

$someofcode$

---

$T27$分$code$

#include<cstdio> #include<cstring> #include<algorithm> #include<vector> using namespace std; const int N=101000; 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; }; vector<int> q[N],c[N]; struct Line_cut_tree{Tree_node t[N<<2];void megre(Tree_node &t,Tree_node tl,Tree_node tr){t.w=tl.w+tr.w;t.c=max(tl.c,tr.c);}void build(int x,int l,int r){t[x].l=l;t[x].r=r;if(l==r){t[x].w=0;t[x].c=0;return;}int mid=(l+r)/2;build(x*2,l,mid);build(x*2+1,mid+1,r);megre(t[x],t[x*2],t[x*2+1]);}int Ask(int x,int l,int r){if(t[x].l==l&&t[x].r==r)return t[x].c;if(r<=t[x*2].r) return Ask(x*2,l,r);else if(l>t[x*2].r) return Ask(x*2+1,l,r);else return max(Ask(x*2,l,t[x*2].r),Ask(x*2+1,t[x*2+1].l,r));}void Change(int x,int pos,int z){if(t[x].l==t[x].r){t[x].w++;t[x].c=z;return;}if(pos<=t[x*2].r) Change(x*2,pos,z);else if(pos>t[x*2].r) Change(x*2+1,pos,z);megre(t[x],t[x*2],t[x*2+1]);} }Tree; void addl(int x,int y) {a[++tot].to=y;a[tot].next=ls[x];ls[x]=tot; } void ycl(int x) {siz[x]=1;for(int i=ls[x];i;i=a[i].next){int y=a[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 i=ls[x];i;i=a[i].next){int y=a[i].to;if(y==son[x]) continue;dfs(y,y);}int mid=cnt;dfs(son[x],x);for(int i=id[x]+1;i<=mid;i=ed[seg[i]]+1){for(int j=i;j<=ed[seg[i]];j++){int z=max(Tree.Ask(1,1,w[seg[j]]),ans[seg[j]]);Tree.Change(1,w[seg[j]],z);}}int z=Tree.Ask(1,1,w[x]);ans[x]=z+1;Tree.Change(1,w[x],z+1);ed[x]=cnt;if(top==x)for(int i=id[x];i<=ed[x];i++)Tree.Change(1,w[seg[i]],ans[seg[i]]-1); } int main() {scanf("%d",&n);Tree.build(1,1,n);for(int i=1;i<=n;i++){int x;scanf("%d",&x);if(i==1) continue;addl(x,i);}for(int i=1;i<=n;i++)scanf("%d",&w[i]);ycl(1);dfs(1,1);for(int i=1;i<=n;i++)printf("%d ",ans[i]); }

---

總結(jié)

很煩不想寫

---

$$\text{-\_-}$$

最后的最后
$$\begin{gathered} \begin{array}{c}?\end{array} \\ \text{這使你充滿了決心} \end{gathered}$$

總結(jié)

以上是生活随笔為你收集整理的欢乐纪中某A组赛【2019.7.9】的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。