
分块-莫队
文章平均质量分 66
snowy_smile
终于在ICPC World Final里拿到了气球!
再努力一点吧,坚持下去吧,梦想是会实现的! 人生会有低谷,但我更相信,未来也会有更多梦想能够实现~
展开
-
莫队分块算法模板[BZOJ2038]
#include<stdio.h>#include<string.h>#include<ctype.h>#include<math.h>#include<iostream>#include<string>#include<set>#include<map>#include<vector>#include<queue>#include<bitset>#include<algori原创 2015-10-28 09:27:01 · 1681 阅读 · 0 评论 -
【BZOJ3289】【莫队分块+树状数组求逆序对】Mato的文件管理
3289: Mato的文件管理Time Limit: 40 Sec Memory Limit: 128 MBSubmit: 1123 Solved: 495[Submit][Status][Discuss]DescriptionMato同学从各路神犇以各种方式(你们懂的)收集了许多资料,这些资料一共有n份,每份有一个大小和一个编号。为了防止他人偷拷,这些资料都是加密过的原创 2015-10-29 10:42:18 · 681 阅读 · 0 评论 -
【HDU5381_多校第八场B】【莫队算法】区间GCD之和_分段预处理
#include<stdio.h>#include<iostream>#include<string.h>#include<ctype.h>#include<math.h>#include<map>#include<set>#include<vector>#include<queue>#include<functional>#include<string>#include<al原创 2015-10-28 16:32:11 · 835 阅读 · 1 评论 -
【CodeForces Yandex Algorithm 2011 D】【莫队分块】区间所有数值乘其数个数的平方
#include<stdio.h>#include<string.h>#include<ctype.h>#include<math.h>#include<iostream>#include<string>#include<set>#include<map>#include<vector>#include<queue>#include<bitset>#include<algori原创 2015-10-28 20:30:12 · 541 阅读 · 0 评论 -
【HDU5213 BestCoder Round 39D】【莫队算法+容斥】Lucky 两个区间各选一个数使得和为K的方案数
#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:原创 2015-11-19 18:33:41 · 940 阅读 · 0 评论 -
【Codeforces Round 340 (Div 2)E】【莫队算法 真实区间思想】XOR and Favorite Number m组区间询问 问区间中多少连续段异或值为k
E. XOR and Favorite Numbertime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob has a favorite number k and ai原创 2016-02-28 13:06:45 · 4088 阅读 · 0 评论