树状数组
softrice
这个作者很懒,什么都没留下…
展开
-
hdu 2491 pingpong
树状数组。#include#include#includeusing namespace std;#define maxn 100006int a[maxn];int n=maxn;int lowbit(int i){ return i&(-i);}int Sum(int i){ int sum=0; while(i>=1) { sum+=a[i]; i-原创 2013-04-17 14:36:59 · 930 阅读 · 0 评论 -
Find the nondecreasing subsequences HDU 2227
树状数组#include#include#include#includeusing namespace std;#define maxn 100006int a[maxn];int n=maxn;struct Note{int val,ord;}b[maxn];bool cmp(Note a,Note b){return a.val<b.val;}int原创 2013-04-17 23:41:07 · 857 阅读 · 0 评论 -
Minimum Inversion Number HDU 1394
用树状数组求逆序数。#include#include#includeusing namespace std;#define maxn 5004int a[maxn];int n=maxn;int lowbit(int i){ return i&(-i);}int Sum(int i){ int sum=0; while(i>=1) { sum+=a[i];原创 2013-04-17 21:48:33 · 769 阅读 · 0 评论 -
树状数组模型
模板1:改点求段http://acm.hdu.edu.cn/showproblem.php?pid=1166 hdu 1166 敌兵布阵#include#include#includeusing namespace std;int a[50004],n;char str[20];int lowbit(int i){ return i&(-i);}int Sum原创 2013-04-16 19:36:57 · 902 阅读 · 0 评论 -
hdu 1394——Minimum Inversion Number
线段树#include#includeusing namespace std;#define maxn 5010#define ls (rt<<1)#define rs (rt<<1|1)#define mid ((t[rt].l+t[rt].r)>>1)struct tree{ int l,r; int sum;}t[maxn<<4];int num[maxn];v原创 2013-07-28 16:06:16 · 754 阅读 · 0 评论