【2019徐州网络赛 I】query（二维偏序）
Given a permutation pp of length nn, you are asked to answer mm queries, each query can be represented as a pair (l ,r )(l,r), you need to find the number of pair(i ,j)(i,j) such that $l≤i<j≤r and&...
原创
2019-09-12 23:18:21 ·
270 阅读 ·
0 评论
关注
分享
扫一扫