- 博客(1)
- 收藏
- 关注
原创 POJ3468(线段树之区间更新)
POJ3468(线段树之区间更新)A Simple Problem with Integers You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of
2017-02-16 16:49:10 613
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人