参考:今天下雨了
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#define Maxn 10000
using namespace std;
int tttt,maxx;
struct node
{
int l, r, cnt;
} xx[2500000];
void build(int a, int b, int n)
{
if(n > maxx) maxx = n;
xx[n].l = a;
xx[n].r = b;
xx[n].cnt = 0;
if(a == b) return ;
int mid = (a + b) >> 1;
build(a, mid, n << 1);
build(mid + 1, b, n << 1 | 1);
}
void inset(int s, int t, int id)//要插入的线段的左端点和右端点、以及当前线段树中的某条线段
{
if(xx[id].l == s && xx[id].r == t)
{
xx[id].cnt++;
return;
}
if(xx[id].l == xx[id].r) return ;//当前线段树的线段没有儿子,插入结束返回
int mid = (xx[id].l + xx[id].r) >> 1;
if(t <= mid) inset(s, t, id << 1);
else if(mid < s) inset(s, t, id << 1 | 1);
else
{
inset(s, mid, id << 1);
inset(mid + 1, t, id << 1 | 1);
}
}
void cou(int id)
{
xx[id].cnt += xx[id/2].cnt;
if(xx[id].l == xx[id].r)
{
printf("%d", xx[id].cnt);
if(xx[id].l == tttt) puts("");
else putchar(' ');
return ;
}
cou(id<<1);
cou(id<<1|1);
}
int main()
{
while(scanf("%d", &tttt), tttt)
{
maxx = 0;
build(1, tttt, 1);
for(int i = 0; i < tttt; i ++)
{
int ll, rr;
scanf("%d%d", &ll, &rr);
inset(ll, rr, 1);
}
cou(1);
}
return 0;
}
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#define Maxn 10000
using namespace std;
int tttt,maxx;
struct node
{
int l, r, cnt;
} xx[2500000];
void build(int a, int b, int n)
{
if(n > maxx) maxx = n;
xx[n].l = a;
xx[n].r = b;
xx[n].cnt = 0;
if(a == b)
{
scanf("%d",&xx[n].cnt);
return ;
}
int mid = (a + b) >> 1;
build(a, mid, n << 1);
build(mid + 1, b, n << 1 | 1);
xx[n].cnt = xx[n << 1].cnt + xx[n << 1 | 1].cnt;
}
void update(int pos, int add, int rt)
{
if(xx[rt].l == xx[rt].r)
{
xx[rt].cnt += add;
return ;
}
int mid = ( xx[rt].l + xx[rt].r ) >> 1;
if(pos <= mid) update(pos, add, rt << 1);
else update(pos, add, rt << 1 | 1);
xx[rt].cnt = xx[rt << 1].cnt + xx[rt << 1 | 1].cnt;
}
int querry(int left, int right, int rt)
{
if(left <= xx[rt].l && xx[rt].r <= right)
{
return xx[rt].cnt;
}
int ret = 0;
int mid = ( xx[rt].l + xx[rt].r ) >> 1;
if(left <= mid) ret += querry(left, right, rt<<1);
if(right > mid) ret += querry(left, right, rt << 1 | 1);
return ret;
}
int main()
{
int T;
scanf("%d", &T);
for(int i = 1; i <= T; i++)
{
printf("Case %d:\n",i);
int n;
scanf("%d", &n);
build(1, n, 1);
char op[10];
while(scanf("%s", op))
{
if(op[0] == 'E') break;
int a, b;
scanf("%d%d", &a, &b);
if(op[0] == 'A') update(a, b, 1);
if(op[0] == 'S') update(a, -b, 1);
if(op[0] == 'Q') printf("%d\n", querry(a, b, 1));
}
}
return 0;
}
再来一发。。。
PickUP(int rt)是把当前结点的信息更新到父结点
线段树功能:update:单点增减 query:区间求和
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#define Maxn 50005
using namespace std;
int sum[Maxn << 2];
void Pickup(int rt)
{
sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
void build(int l, int r, int rt)
{
if(l == r)
{
scanf("%d", &sum[rt]);
return ;
}
int mid = (l + r) >> 1;
build(l, mid, rt << 1);
build(mid + 1, r, rt << 1 | 1);
Pickup(rt);
}
void update(int a, int add, int L, int R, int rt)
{
if(L == R)
{
sum[rt] += add;
return ;
}
int mid = (L + R) >> 1;
if(a <= mid) update(a, add, L, mid, rt << 1);
else update(a, add, mid + 1, R, rt << 1 | 1);
Pickup(rt);
}
int query(int l, int r, int L, int R, int rt)
{
if(l <= L && R <= r)
{
return sum[rt];
}
int mid = (L + R) >> 1;
int ret = 0;
if(r <= mid) ret += query(l, r, L, mid, rt << 1);
else if( l > mid) ret += query(l, r, mid + 1, R, rt << 1 | 1);
else
{
ret += query(l, r, L, mid, rt << 1);
ret += query(l, r, mid + 1, R, rt << 1 | 1);
}
return ret;
}
int main()
{
int T;
scanf("%d", &T);
for(int i = 1; i <= T; i++)
{
int n;
scanf("%d", &n);
build(1, n, 1);
char op[10];
printf("Case %d:\n", i);
while(scanf("%s", op))
{
if(op[0] == 'E') break;
int a, b;
scanf("%d%d", &a, &b);
if(op[0] == 'A') update(a, b, 1, n, 1);
if(op[0] == 'S') update(a, -b, 1, n, 1);
if(op[0] == 'Q') printf("%d\n", query(a, b, 1, n, 1));
}
}
return 0;
}
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#define Maxn 200005
using namespace std;
int sum[Maxn << 2];
void Pickup(int rt)
{
sum[rt] = max(sum[rt << 1], sum[rt << 1 | 1]);
}
void build(int l, int r, int rt)
{
if(l == r)
{
scanf("%d", &sum[rt]);
return ;
}
int mid = (l + r) >> 1;
build(l, mid, rt << 1);
build(mid + 1, r, rt << 1 | 1);
Pickup(rt);
}
void update(int a, int add, int L, int R, int rt)
{
if(L == R)
{
sum[rt] = add;
return ;
}
int mid = (L + R) >> 1;
if(a <= mid) update(a, add, L, mid, rt << 1);
else update(a, add, mid + 1, R, rt << 1 | 1);
Pickup(rt);
}
int query(int l, int r, int L, int R, int rt)
{
if(l <= L && R <= r)
{
return sum[rt];
}
int mid = (L + R) >> 1;
int ret = 0;
if(r <= mid) ret = max(ret, query(l, r, L, mid, rt << 1));
else if( l > mid) ret = max(query(l, r, mid + 1, R, rt << 1 | 1), ret);
else
{
ret = max(ret, query(l, r, L, mid, rt << 1));
ret = max(query(l, r, mid + 1, R, rt << 1 | 1), ret);
}
return ret;
}
int main()
{
int n, m;
while(scanf("%d%d", &n, &m) != EOF)
{
memset(sum, 0, sizeof(sum));
build(1, n, 1);
getchar();
while(m --)
{
char op;
scanf("%c", &op);
int a, b;
scanf("%d%d", &a, &b);
getchar();
if(op == 'U') update(a, b, 1, n, 1);
if(op == 'Q') printf("%d\n", query(a, b, 1, n, 1));
}
}
return 0;
}
HDU 1394 Minimum Inversion Number
利用线段树求序列的逆序数。只需求出原始的逆序数,右移的情况可以由前面的推导出来。。
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#define Maxn 200005
using namespace std;
int sum[Maxn << 2];
void Pickup(int rt)
{
sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
void built(int l, int r, int rt)
{
sum[rt] = 0;
if(l == r) return;
int mid = (l + r) >> 1;
built(l, mid, rt << 1);
built(mid + 1, r, rt << 1 | 1);
}
void update(int a, int L, int R, int rt)
{
if(L == R)
{
sum[rt] ++;
return ;
}
int mid = (L + R) >> 1;
if(a <= mid) update(a, L, mid, rt << 1);
else update(a, mid + 1, R, rt << 1 | 1);
Pickup(rt);
}
int query(int l, int r, int L, int R, int rt)
{
if(l <= L && R <= r)
{
return sum[rt];
}
int mid = (L + R) >> 1;
int ret = 0;
if(r <= mid) ret += query(l, r, L, mid, rt << 1);
else if( l > mid) ret += query(l, r, mid + 1, R, rt << 1 | 1);
else
{
ret += query(l, r, L, mid, rt << 1);
ret += query(l, r, mid + 1, R, rt << 1 | 1);
}
return ret;
}
int main()
{
int n;
while(scanf("%d",&n) != EOF)
{
built(0, n-1, 1);
int ans = 0;
int x[5555];
for(int i = 0; i < n; i++)
{
scanf("%d", &x[i]);
ans += query(x[i], n-1, 0, n-1, 1);
update(x[i], 0, n-1, 1);
}
int ret = ans;
for(int i = 0; i < n; i++)
{
ans += n - x[i] - x[i] - 1;
ret = min(ret, ans);
}
printf("%d\n", ret);
}
return 0;
}
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#define Maxn 200005
using namespace std;
int sum[Maxn << 2];
int h, w, n;
void built(int l, int r, int rt)
{
sum[rt] = w;
if(l == r) return;
int mid = (l + r) >> 1;
built(l, mid, rt << 1);
built(mid + 1, r, rt << 1 | 1);
}
int query(int add, int l, int r, int rt)
{
if(l == r)
{
sum[rt] -= add;
return l;
}
int mid = (l + r) >> 1;
int ret = 0;
if(sum[rt << 1] >= add) ret = query(add, l, mid, rt << 1);
else ret = query(add, mid + 1, r, rt << 1 | 1);
sum[rt] = max(sum[rt << 1] , sum[rt<< 1 | 1]);
return ret;
}
int main()
{
while(scanf("%d%d%d", &h, &w, &n) != -1)
{
if(h > n) h = n; //可以减小h的规模
built(1, h, 1);
for(int i = 0; i < n; i++)
{
int x;
scanf("%d", &x);
if(sum[1] < x) puts("-1");
else printf("%d\n", query(x, 1, h, 1));
}
}
return 0;
}
POJ 2828 Buy Tickets
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#define Maxn 200005
using namespace std;
int pos[200005], val[200005], seq[200005];
int sum[Maxn << 2];
int hehe;
void built(int l, int r, int rt)
{
sum[rt] = r - l + 1;
if(l == r) return ;
int mid = (l + r) >> 1;
built(l, mid, rt << 1);
built(mid + 1, r, rt << 1 | 1);
}
void update(int p, int l, int r, int rt)
{
sum[rt]--;
if(l == r)
{
hehe = l;
return ;
}
int mid = (l + r) >> 1;
if(p <= sum[rt << 1])
update(p, l, mid, rt<<1);
else
update(p-sum[rt<<1], mid + 1, r, rt<<1|1);
}
int main()
{
int n;
while(scanf("%d", &n) != EOF)
{
built(1, n, 1);
for(int i = 0; i < n; i++)
scanf("%d%d", &pos[i], &val[i]);
for(int i = n-1; i>= 0; i--)
{
update(pos[i] + 1, 1, n, 1);
seq[hehe] = val[i];
}
for(int i = 1; i <= n; i++)
{
printf("%d", seq[i]);
if(i != n)
printf(" ");
}
puts("");
}
return 0;
}
POJ 2886 Who Gets the Most Candies?
线段树+反素数 线段树区间存储未出局的小朋友数(与poj2828类似)
#include <iostream>
#include <math.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#define maxn 500001
using namespace std;
char name[maxn][11];
int val[maxn];
/* a为反素数表,b为对应的约数个数 */
int a[37]= {1,2,4,6,12,24,36,48,60,120,180,240,360,720,840,1260,1680,2520,5040,7560,10080,15120,20160,25200,27720,45360,50400,
55440,83160,110880,166320,221760,277200,332640,498960,500001
};
int b[37]= {1,2,3,4,6,8,9,10,12,16,18,20,24,30,32,36,40,48,60,64,72,80,84,90,96,100,108,120,128,144,160,168,180,192,200,1314521};
int sum[ 500001 << 2];
void built(int l, int r, int rt)
{
sum[rt] = r - l + 1;
if(l == r) return ;
int mid = ( l + r) >> 1;
built(l, mid, rt << 1);
built(mid+1, r, rt << 1 | 1);
}
int query(int num, int l, int r, int rt)
{
sum[rt] --;
if(l == r) return l;
int mid = ( l + r) >> 1;
if(num <= sum[rt<<1]) return query(num,l,mid,rt<<1);
else return query(num-sum[rt<<1], mid+1, r, rt<<1|1);
}
int main()
{
int n, k;
while(scanf("%d%d", &n, &k) != EOF)
{
int i = 0, Max = 0, p = 0;
while(a[i] <= n)
i++;
p = a[i - 1];
Max = b[i - 1];
built(1, n, 1);
for(i = 1; i <= n; i++)
scanf("%s %d", name[i], &val[i]);
k--;
int idx, temp = n;
for(i = 0; i< p; i++)
{
temp--;
idx = query(k+ 1, 1, n, 1);
if( i == p - 1) break;
if(val[idx] > 0)
k = (k + val[idx] - 1) % temp;
else k = ((k + val[idx]) % temp + temp) % temp;
}
printf("%s %d\n", name[idx], Max);
}
return 0;
}