线段树
newhonor
可以不伟大,但不能卑微
展开
-
K. Addition Robot
http://codeforces.com/contest/1252/problem/K#include <bits/stdc++.h>//#include <queue>//#include <cmath>//#include <iostream>//#include <unordered_map>#define l...原创 2019-11-07 23:12:03 · 249 阅读 · 0 评论 -
Find the answer
http://acm.hdu.edu.cn/showproblem.php?pid=6609#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#...原创 2019-10-19 17:23:53 · 123 阅读 · 0 评论 -
Longest Subarray
http://acm.hdu.edu.cn/showproblem.php?pid=6602标志每种数字对哪个区间贡献不合法标志,查找0的位置#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>...原创 2019-10-16 16:34:53 · 108 阅读 · 0 评论 -
Distribution of books
http://acm.hdu.edu.cn/showproblem.php?pid=6606#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#...原创 2019-10-15 10:35:08 · 148 阅读 · 0 评论 -
CCPC-Wannafly & Comet OJ 夏季欢乐赛(2019) 茶颜悦色
https://www.cometoj.com/contest/59/problem/D思路:对y轴离散化;扫描x轴; 处理每个点对哪个区间有贡献;一旦x坐标超出k就是把贡献减掉;#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#i...原创 2019-08-11 16:59:26 · 104 阅读 · 0 评论 -
Greedy Sequence
https://nanti.jisuanke.com/t/41303#include<bits/stdc++.h>using namespace std;const int maxn=1e5+5;int max(int a, int b){ return a>b ? a : b;}int tree[4 * maxn];int Pos[maxn];void...原创 2019-09-02 15:03:18 · 95 阅读 · 0 评论 -
The Preliminary Contest for ICPC Asia Xuzhou 2019so easy
https://nanti.jisuanke.com/t/41384思路:离散化,线段树,要么自己本身,要么就是区间去掉得下一个;#include <bits/stdc++.h>#include <tr1/unordered_map>#define endl '\n'#define FAST_IO ios::sync_with_stdio(false);c...原创 2019-09-07 22:20:19 · 106 阅读 · 0 评论 -
The Preliminary Contest for ICPC Asia Xuzhou 2019 XKC's basketball team
https://nanti.jisuanke.com/t/41387不符合得节点要退出,不然会tle;#include<bits/stdc++.h>#define endl '\n'#define mem(a) memset(a,0,sizeof(a))using namespace std;typedef long long ll;const int N=5e5...原创 2019-09-07 22:24:07 · 137 阅读 · 0 评论 -
CodeCoder vs TopForces Gym - 101142C
https://vjudge.net/problem/Gym-101142C#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#include &...原创 2019-10-05 17:19:33 · 87 阅读 · 0 评论 -
Hotel
https://ac.nowcoder.com/acm/contest/997/C总结:线段树区间合并;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstd...原创 2019-07-26 18:46:23 · 125 阅读 · 0 评论 -
P4114 Qtree1
https://www.luogu.org/problemnew/show/P4114/*#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>*/...原创 2019-07-16 23:12:47 · 91 阅读 · 0 评论 -
Gorgeous Sequence
http://acm.hdu.edu.cn/showproblem.php?pid=5306#include<algorithm>#include<set>#include<cmath>#include<cstring>#include<iostream>#include<set>#include<v...原创 2019-07-18 10:18:37 · 208 阅读 · 0 评论 -
E. Painting the Fence
http://codeforces.com/gym/101911/problem/E题意:给n个初始颜色,m次涂色,每指定一种颜色这种颜色最左到最右染色,问最后的颜色序列;思路:(1)对每种颜色维护他的下标,每次染色将区间内的下标除去;如果有颜色已经染过就直接跳到该颜色最右;(已经染色过的他的区间内的下标已经清除了所以这个区间必然是被包含的); (2)线段树;...原创 2019-04-09 22:11:26 · 421 阅读 · 0 评论 -
GCD Problem
https://ac.nowcoder.com/acm/contest/877/F题意:区间查询gcd,区间开方修改;思路:线段树;要记录如果一个区间全都是1就直接返回1,否则会tle;查询单点是注意gcd不了;#include<algorithm>#include<set>#include<vector>#include<queue...原创 2019-04-26 17:26:54 · 225 阅读 · 0 评论 -
小石的妹子
https://ac.nowcoder.com/acm/contest/949/F总结:虽然以前做过排序一维,另一维线段树维护,但做的少,难出思路;#include<bits/stdc++.h>using namespace std;#define sfi(i) scanf("%d",&i)#define sfs(i) scanf("%s",(i))...原创 2019-07-13 10:51:06 · 287 阅读 · 0 评论 -
5028: 小Z的加油店
https://www.lydsy.com/JudgeOnline/problem.php?id=5028思路:差分;得到差分数组a;a[i]的原值就是差分数组前缀和,所以都可以线段树处理;总结:#include<bits/stdc++.h>using namespace std;#define sfi(i) scanf("%d",&i)#define ...原创 2019-07-13 17:16:43 · 131 阅读 · 0 评论 -
小阳的贝壳
https://ac.nowcoder.com/acm/contest/949/H思路:线段树查询区间gcd,区间修改,差值最值#include<bits/stdc++.h>using namespace std;#define sfi(i) scanf("%d",&i)#define sfs(i) scanf("%s",(i))#define pri(i...原创 2019-07-13 20:07:06 · 176 阅读 · 0 评论 -
Bash and a Tough Math Puzzle
https://cn.vjudge.net/problem/CodeForces-914D反思:查询时注意各种情况;很容易忽略一些区间和%的情况;#include<bits/stdc++.h>using namespace std;#define sfi(i) scanf("%d",&i)#define sfs(i) scanf("%s",(i))#def...原创 2019-07-13 20:39:31 · 131 阅读 · 0 评论 -
HDU5726 GCD
http://acm.hdu.edu.cn/showproblem.php?pid=5726思路:1直接线段树gcd,2,dp每次添加a[i],后gcd数量更新;#include<bits/stdc++.h>using namespace std;#define sfi(i) scanf("%d",&i)#define sfs(i) scanf("%s",(...原创 2019-07-13 22:14:26 · 130 阅读 · 0 评论 -
No Pain No Game
http://acm.hdu.edu.cn/showproblem.php?pid=4630思路:每次添加a[i];记录a[i]分因子位置;如果因子k出现过,那么当前位置到因子k上一次的位置最大两个gcd最少为k;维护线段树区间最大因子;同时离线处理右区间是当前位置的询问#include<bits/stdc++.h>using namespace std;#defin...原创 2019-07-14 10:47:43 · 222 阅读 · 0 评论 -
A Simple Problem with Integers
http://poj.org/problem?id=3468线段树区间修改,区间查询#include<algorithm>#include<set>#include<vector>#include<queue>#include<cmath>#include<cstring>#include<ios...原创 2019-03-25 22:51:16 · 65 阅读 · 0 评论