Marcythm-Archive / gitalk

1 stars 0 forks source link

「BJOI 2018」链上二次求和 | Trisolaris's Blog #31

Open Marcythm opened 5 years ago

Marcythm commented 5 years ago

https://blog.trisolaris.top/%E3%80%8CBJOI-2018%E3%80%8D%E9%93%BE%E4%B8%8A%E4%BA%8C%E6%AC%A1%E6%B1%82%E5%92%8C/

Problem Description 给定一个长度为 n 的数组 val ,要求支持两种操作: 给定 u,v,d ,将所有满足 i\in\left[\min\left(u,v\right),\max\left(u,v\right)\right]