Magnificent Tree 牛客竞赛三维偏序问题 CDQ分治+树状数组

最新推荐文章于 2020-04-28 20:30:36 发布

原创

最新推荐文章于 2020-04-28 20:30:36 发布 · 309 阅读

2 ·

CC 4.0 BY-SA版权

本文介绍了一次牛客网的编程竞赛，涉及到的问题是关于在二维矩阵中进行树状数组更新和查询的三维偏序问题。竞赛中，园林工人们在华中科技大学的休闲地种植树木，矩阵大小为W×W，每天可能会对某个坐标(x, y)的树浇水，使树的高度增长H，或者询问(x1, y1)到(x2, y2)子矩阵内树木高度之和。通过CDQ分治算法与树状数组的数据结构，可以有效地解决此类问题，实现高效更新和查询操作。" 116188239,10518382,使用Jetson GPIO库配置Jetson Nano的GPIO,"['嵌入式开发', '硬件接口', 'Python编程', 'Jetson开发', 'GPIO接口']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

链接：https://ac.nowcoder.com/acm/contest/106/H?&headNav=www
来源：牛客网

It’s universally acknowledged that there’re innumerable trees in the campus of HUST.

There is a new leisure ground at the gate of HUST. The president of HUST wants to plant a group of trees on the ground and he wants the trees to be planted exactly like a square matrix. And then the gardens start their work. In the next N days, the gardens can water a tree in coordinate: (x, y) and it makes the height of the tree grows H. Sometimes, the president wants to know how magnificent his trees are. The president will give the gardens two coordinates: (x1, y1), (x2, y2). The gardens should report the sum of the heights of the trees in the sub matrix represents by the two coordinates. There will be A days that the gardens will water a tree. And there will be Q days that the president will ask