线段树
nuoyanli
做题,反思,做题;刷题,总结,刷题;
展开
-
Hdu 5726 (st+rmq+二分 求相同gcd的区间数量,map计数)
题目来源http://acm.hdu.edu.cn/showproblem.php?pid=5726题面题意给定一个序列(len≤105,ai≤109len \leq 10^5,a_i \leq 10^9len≤105,ai≤109),给出q(q≤1∗105)q(q\leq1*10^5)q(q≤1∗105)个询问,对于每个询问给出一个区间[l,r](1≤l,r≤len)[l,r](1\...原创 2019-12-27 12:20:30 · 1541 阅读 · 0 评论 -
G - Sliding Window POJ - 2823(单调队列 && 线段树写法(线段树板子))
题目来源:https://vjudge.net/contest/292642#problem/Ghttp://poj.org/problem?id=2823DescriptionAn array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the ...原创 2019-04-05 07:50:16 · 3381 阅读 · 3 评论 -
B - Minimum 线段树单点更新
题目来源:https://vjudge.net/contest/293466#problem/Bhttps://vjudge.net/problem/1087342/originYou are given a list of integers a0, a1, …, a2^k-1.You need to support two types of queries:1. Output...原创 2019-04-07 14:04:35 · 3303 阅读 · 0 评论 -
codeforces-1154E Two Teams(链表实现||线段树+路径压缩||set+并查集)
题目来源:https://codeforces.com/contest/1154/problem/E代码来自:fzchen.topThere arennstudents standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the secon...转载 2019-04-17 11:51:44 · 1943 阅读 · 0 评论 -
士兵杀敌(三)RMQ板子
题目来源:http://nyoj.top/web/contest/problem/cid/3/num/C题目描述:南将军统率着N个士兵,士兵分别编号为1~N,南将军经常爱拿某一段编号内杀敌数最高的人与杀敌数最低的人进行比较,计算出两个人的杀敌数差值,用这种方法一方面能鼓舞杀敌数高的人,另一方面也算是批评杀敌数低的人,起到了很好的效果。所以,南将军经常问军师小工第i号士兵到第j号士兵...原创 2019-04-22 21:34:28 · 1378 阅读 · 0 评论