![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
Jianhong Li
这个作者很懒,什么都没留下…
展开
-
20210419 端点
package contest;import java.io.BufferedReader;import java.io.FileInputStream;import java.io.InputStreamReader;import java.util.Arrays;import java.util.StringTokenizer;public class Terminal { static final int maxN = 300005; static final int maxM =原创 2021-04-19 19:32:39 · 61 阅读 · 0 评论 -
Java树状数组【Binary Indexed Tree】应用
单点更新–求区间最大(小)值import java.util.Arrays;public class BIT_MaxMin { static final int maxN = 50; static int N; static int[] bitMax = new int[maxN]; static int[] bitMin = new int[maxN]; static int[] arr = new int[maxN]; public static原创 2021-04-18 21:57:10 · 271 阅读 · 1 评论