09 2014 档案

poj_3468,线段树成段更新
摘要：参考自http://www.notonlysuccess.com/index.php/segment-tree-complete/#include#include#include#include#define lson l,m,rt>1)); sum[rt>1); col... 阅读全文
posted @ 2014-09-13 20:52 JarvisLau 阅读(133) 评论(0) 推荐(0)
hdu_2795,线段树，单点更新
摘要：#include#include#include#define lson l,m,rt>1; build(lson); build(rson);}int query(int d,int l,int r,int rt){ int ret=-1; if(l==r) { ... 阅读全文
posted @ 2014-09-12 07:43 JarvisLau 阅读(109) 评论(0) 推荐(0)
hdu_1394，线段树求逆序数
摘要：http://www.notonlysuccess.com/index.php/segment-tree-complete/#include#include#include#include#define lson l,m,rt>1; build(lson); build(rson);}v... 阅读全文
posted @ 2014-09-11 20:02 JarvisLau 阅读(164) 评论(0) 推荐(0)
hdu_1754，线段树单点更新，求区间最值
摘要：http://www.notonlysuccess.com/index.php/segment-tree-complete/#include#include#include#include#define lson l,m,rt>1; build(lson); build(rson); ... 阅读全文
posted @ 2014-09-10 17:51 JarvisLau 阅读(154) 评论(0) 推荐(0)
hdu_1166,线段树单点更新
摘要：在刷线段树，参考自http://www.notonlysuccess.com/index.php/segment-tree-complete/#include#include#include#define lson l,m,rt>1; build(lson); build(rson); ... 阅读全文
posted @ 2014-09-10 12:22 JarvisLau 阅读(145) 评论(0) 推荐(0)
poj_2481,Cows,树状数组
摘要：将e按从大到小排序，统计前i-1个中比#include#include#include#includeusing namespace std;struct Item{ int s; int e; int x;};int n;Item item[500010];int a[50001... 阅读全文
posted @ 2014-09-09 21:19 JarvisLau 阅读(144) 评论(0) 推荐(0)
poj_1195Mobile phones,二维树状数组
摘要：#include#include#include#includeusing namespace std;int a[1300][1300];int s;int lowbit(int x){ return x&(-x);}void add(int x,int y,int d){ for(in... 阅读全文
posted @ 2014-09-05 20:11 JarvisLau 阅读(140) 评论(0) 推荐(0)
poj_2299Ultra-QuickSort,树状数组离散化
摘要：求逆序数#include#include#include#includeusing namespace std;struct node{ int num; int pos;};node st[500010];int reflect[500010];int a[500010];int n;... 阅读全文
posted @ 2014-09-04 22:14 JarvisLau 阅读(147) 评论(0) 推荐(0)
uva_11997,K Smallest Sums优先队列
摘要：#include#include#include#include#includeusing namespace std;int a[1000][1000];int n;struct Item{ int jx,sum; bool operator a.sum; }};void sol... 阅读全文
posted @ 2014-09-03 17:50 JarvisLau 阅读(130) 评论(0) 推荐(0)
LA_3135优先队列
摘要：#include #include #include #include using namespace std;struct st{ int QNum,Period,time; bool operator a.time||(time==a.time&&QNum>a.QNum); }... 阅读全文
posted @ 2014-09-03 13:21 JarvisLau 阅读(143) 评论(0) 推荐(0)
uva_127,栈以及vector的应用
摘要：参考自http://www.cnblogs.com/maqiang/archive/2012/05/02/2479760.html#include #include #include #include #include #include using namespace std;struct st{ ... 阅读全文
posted @ 2014-09-02 14:12 JarvisLau 阅读(165) 评论(0) 推荐(0)