树状数组
newhonor
可以不伟大,但不能卑微
展开
-
B. Balanced Tunnel
http://codeforces.com/contest/1237/problem/B#include <bits/stdc++.h>//#include <cmath>//#include <iostream>//#include <unordered_map>#define lowbit(x) ((x)&(-x))#d...原创 2019-11-02 10:31:33 · 137 阅读 · 0 评论 -
poj2893
#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#include <set>#include <map>#incl...原创 2019-10-20 13:26:18 · 150 阅读 · 0 评论 -
Cameras Gym - 101291D
https://cn.vjudge.net/problem/Gym-101291D#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#includ...原创 2019-10-06 22:10:39 · 177 阅读 · 0 评论 -
Bishops Alliance Gym - 101147F
https://cn.vjudge.net/problem/Gym-101147Fi-j>=pi^2+pj^2+C => i-pi^2>=j+pj^2+C-1;最长上升子序列,树状数组维护;#include <iostream>#include <cstring>#include <queue>#include...原创 2019-09-22 16:09:20 · 129 阅读 · 0 评论 -
Intersections Gym - 101853C
https://cn.vjudge.net/problem/Gym-101853C#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#includ...原创 2019-09-04 16:37:02 · 265 阅读 · 0 评论 -
The beautiful values of the palace
https://nanti.jisuanke.com/t/41298螺旋矩阵计算:最外层都可以找规律求出;而里面的就是坐标缩小一下,n缩小一下就是一样的计算了;n方是要longlong;离散二维差分:离散求和计算原坐标二维前缀和;#include <iostream>#include <cstring>#include <queue>#in...原创 2019-09-03 11:49:32 · 181 阅读 · 0 评论 -
Pizza Cutter Gym - 101908C
https://cn.vjudge.net/problem/Gym-101908C思路:离散加逆序对;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cs...原创 2019-08-22 16:10:12 · 140 阅读 · 0 评论 -
H. Lexical Sign Sequence
https://codeforc.es/gym/102001/problem/H思路:字典序最小先全部能改的改成-1,那么先再右边构造1;树状数组维护;#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <qu...原创 2019-08-05 20:47:32 · 273 阅读 · 0 评论 -
无交集的圆
https://ac.nowcoder.com/acm/contest/911/F思路:就是线段相交,1、排序枚举右端点找有多少左端点大于它的,upperbound;2、树状数组维护数量,主要查找是左区间-1#include<algorithm>#include<set>#include<queue>#include<cmath>#...原创 2019-06-04 16:03:45 · 161 阅读 · 0 评论 -
Chika and Friendly Pairs
http://acm.hdu.edu.cn/showproblem.php?pid=6534题意:给n个数的数组,m个询问L-R,k;问区间内差值不超过k的数有多少对;思路:离散化,莫队+树状数组维护;反思:树状数组维护每次指针移动贡献的变化。离散化没学好,离散化就是把数的相对位置处理出来,再操作。把一个离散化了的数减一个没离散的=-=。因为维护时查询R和L-1;所以还要离散化每个元素...原创 2019-05-20 19:08:55 · 607 阅读 · 0 评论 -
Massive
https://ac.nowcoder.com/acm/contest/700/C题意:n个数,连续区间长度在[L,R]之间的和大于等于s的个数;思路:前缀和离散化加树状数组;枚举起点同时更新数组数组的值(前缀和的值);每次差值的因为要满足sum[j]-sum[i-1]>=s;所以每次找的sum[j]>=sum[i-1]+s;反思:题解都看到老半天~,离散化也不记得了,...原创 2019-05-02 10:18:34 · 211 阅读 · 0 评论 -
F. Tickets
http://codeforces.com/gym/101911/problem/F题意:给一个六位的串问比这个数小的且这些数的前三位数与后三位数差值 的绝对值比这个数小的一共有多少个;思路:(1):dp[i]表示前i个数满足条件的个数,从1~1e6枚举,每次记录差值,并加上比它差值小的个数;(2):树状数组枚举1~1e6,更新前后差值个数和查询个数;#include<a...原创 2019-04-08 20:27:15 · 221 阅读 · 0 评论