![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
GUESSERR
这个作者很懒,什么都没留下…
展开
-
3439:A Simple Problem with Integers
传送门题意:Q:输出指定区间的和C:指定区间加所有值加指定值模板代码#include<iostream>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <cmath>#include <st...原创 2021-04-27 16:57:39 · 116 阅读 · 0 评论 -
A Simple Problem with Integers OpenJ_Bailian - 3439
传送门这个主要用到一种方法:不是每次更新都要从根节点更新到叶子节点,更新到枝干就行,在查找的时候在去处理代码:#include<iostream>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <cmath>...原创 2020-02-19 15:41:34 · 158 阅读 · 0 评论 -
Mayor's posters(线段树散点)
Mayor’s posters参考大佬代码:#include<iostream>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <cmath>#include <stack>#include...原创 2020-02-19 15:36:05 · 215 阅读 · 0 评论 -
poj 3264 Balanced Lineup(线段树)
传送门题意:求任意区间最大值以及最小值的差#include<iostream>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <cmath>#include <stack>#include ...原创 2020-02-16 15:17:13 · 139 阅读 · 0 评论 -
字段乘积
传送门两种方法:1:逆元:必须用逆元解决除回去不是原数字的尴尬局面。eg:如果0.5/3=x那么x*3还等于0.5吗?显然不能,那么逆元就好了代码:#include<iostream>#include <cstdio>#include <cmath>#include <cstring>#include <string&g...原创 2020-02-12 12:17:42 · 146 阅读 · 0 评论