牛客:Equivalent Prefixes ( 单调栈 + 思维 )
题目链接
大致题意:
给你两个大小为 nnn 的数组 u、vu、vu、v,求最大的前缀 q(1<=q<=n)q (1<=q<=n)q(1<=q<=n) 满足其任意子区间的 RMQ(u,l,r)==RMQ(v,l,r),(1<=l<=r<=q)RMQ(u,l,r)==RMQ(v,l,r) ,(1<=l<=r<=q)RMQ(u,l,r)==RMQ(v,l,r),(1<=l<=r<=q)
RMQ(w,l,r)指wi,wi+
原创
2020-10-26 21:54:43 ·
193 阅读 ·
0 评论