Codeforces Round #416 (Div. 2) B. Vladik and Complicated Book

Vladik在阅读一本复杂的算法书,根据给定的页数顺序P来阅读。他的妈妈有时会整理书的某段页数,Vladik想知道每次整理后他应该阅读的页面px是否改变。输入包含书的页数、妈妈整理的次数及每次整理的范围和关注的页数,输出每次整理后px是否改变的结果。
摘要由CSDN通过智能技术生成
B. Vladik and Complicated Book
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Vladik had started reading a complicated book about algorithms containing n pages. To improve understanding of what is written, his friends advised him to read pages in some order given by permutationP = [p1, p2, ..., pn], where pi denotes the number of page that should be readi-th in turn.

Sometimes Vladik’s mom sorted some subsegment of permutation

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值