1.hdu 1556
代码:
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define inf 0x3f3f3f3f
#define met(a,b) memset(a,b,sizeof(a))
const int maxn = 1e5+10;
#define lchild rt << 1, l, m
#define rchild rt << 1 | 1, m + 1, r
int tree[maxn<<2],lazy[maxn<<2];
int N;
void push_down(int rt, int len) {
tree[rt << 1] += lazy[rt] * (len - (len >> 1));
lazy[rt << 1] += lazy[rt];
tree[rt << 1 | 1] += lazy[rt] * (len >> 1);
lazy[rt << 1 | 1] += lazy[rt];
lazy[rt] = 0;
}
void update(int L, int R, int delta, int rt = 1, int l = 1, int r = N) {
if (L <= l && r <= R) {
tree[rt] += delta * (r - l + 1);
lazy[rt] += delta;
return;
}
if (lazy[rt]) push_down(rt, r - l + 1);
int m = (l + r) >> 1;
if (L <= m) update(L, R, delta, lchild);
if (R > m) update(L, R, delta, rchild);
}
int query(int L, int R, int rt = 1, int l = 1, int r = N) {
if (L <= l && r <= R) return tree[rt];
if (lazy[rt]) push_down(rt, r - l + 1);
int m = (l + r) >> 1, ret = 0;
if (L <= m) ret += query(L, R, lchild);
if (R > m) ret += query(L, R, rchild);
return ret;
}
int main(){
while(scanf("%d",&N)&&N!=0){
met(tree,0), met(lazy,0);
for(int i=1;i<=N;i++){
int a,b; scanf("%d%d",&a,&b);
update(a,b,1);
}
for(int i=1;i<=N;i++){
printf("%d",query(i,i));
if(i!=N) printf(" ");
}
printf("\n");
}
}
2.hdu 1166
代码:
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define inf 0x3f3f3f3f
#define met(a,b) memset(a,b,sizeof(a))
const int maxn = 5e5+10;
#define lchild rt << 1, l, m
#define rchild rt << 1 | 1, m + 1, r
int tree[maxn<<2],num[maxn];
int N;
void push_up(int rt) {
tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];
}
void build(int rt = 1, int l = 1, int r = N) {
if (l == r) { tree[rt]=num[l]; return; }
int m = (l + r) >> 1;
build(lchild); build(rchild);
push_up(rt);
}
void update1(int p, int delta, int rt = 1, int l = 1, int r = N) {
if (l == r) {
tree[rt] += delta;
return;
}
int m = (l + r) >> 1;
if (p <= m) update1(p, delta, lchild);
else update1(p, delta, rchild);
push_up(rt);
}
void update2(int p, int delta, int rt = 1, int l = 1, int r = N) {
if (l == r) {
tree[rt]-= delta;
return;
}
int m = (l + r) >> 1;
if (p <= m) update2(p, delta, lchild);
else update2(p, delta, rchild);
push_up(rt);
}
int query(int L, int R, int rt = 1, int l = 1, int r = N) {
if (L <= l && r <= R) return tree[rt];
int m = (l + r) >> 1, ret = 0;
if (L <= m) ret += query(L, R, lchild);
if (R > m) ret += query(L, R, rchild);
return ret;
}
int main(){
int t;
int id=1;
scanf("%d",&t);
while(t--){
scanf("%d",&N);
for(int i=1;i<=N;i++) scanf("%d",&num[i]);
build();
printf("Case %d:\n",id++);
char s[10];
while(1){
scanf("%s",s);
if(strcmp(s,"End")==0) break;
else if(strcmp(s,"Query")==0) {int x,y; cin>>x>>y; printf("%d\n",query(x,y));}
else if(strcmp(s,"Add")==0) {int x,y; cin>>x>>y; update1(x,y);}
else {int x,y; cin>>x>>y; update2(x,y);}
}
}
}
3.hdu 1754(单点更新+区间最值)
代码:
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define met(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define lchild rt<<1,l,m
#define rchild rt<<1|1,m+1,r
const int maxn = 2e5+10;
int tree[maxn<<2];
int n,m;
void push_up(int rt)
{
tree[rt]=max(tree[rt<<1],tree[rt<<1|1]);
}
void build(int rt=1,int l=1,int r=n)
{
if(l==r)
{
scanf("%d",&tree[rt]);
return;
}
int m=(l+r)>>1;
build(lchild); build(rchild);
push_up(rt);
}
void updata(int pos,int delta,int rt=1,int l=1,int r=n)
{
if(l==r)
{
tree[rt]=delta;
return;
}
int m=(l+r)>>1;
if(pos<=m) updata(pos,delta,lchild);
else updata(pos,delta,rchild);
push_up(rt);
}
int query(int L,int R,int rt=1,int l=1,int r=n)
{
if(L<=l&&R>=r) return tree[rt];
int m=(l+r)>>1,ret=0;
if(L<=m) ret=max(ret,query(L,R,lchild));
if(R>m) ret=max(ret,query(L,R,rchild));
return ret;
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
met(tree,0);
build();
while(m--)
{
string s;
cin>>s;
if(s=="Q")
{
int x,y;
scanf("%d%d",&x,&y);
printf("%d\n",query(x,y));
}
else
{
int pos,delta;
scanf("%d%d",&pos,&delta);
updata(pos,delta);
}
}
}
}
4.hdu 1698 (区间更新+区间求和)
代码:
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define met(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define lchild rt<<1,l,m
#define rchild rt<<1|1,m+1,r
const int maxn = 1e5+10;
int tree[maxn<<2],lazy[maxn<<2];
int N;
void push_up(int rt) {
tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];
}
void push_down(int rt, int len) {
tree[rt << 1] = lazy[rt] * (len - (len >> 1));
lazy[rt << 1] = lazy[rt];
tree[rt << 1 | 1] = lazy[rt] * (len >> 1);
lazy[rt << 1 | 1] = lazy[rt];
lazy[rt] = 0;
}
void build(int rt = 1, int l = 1, int r = N) {
if (l == r) { tree[rt]=1; return; }
int m = (l + r) >> 1;
build(lchild); build(rchild);
push_up(rt);
}
void update(int L, int R, int delta, int rt = 1, int l = 1, int r = N) {
if (L <= l && r <= R) {
tree[rt] = delta * (r - l + 1);
lazy[rt] = delta;
return;
}
if (lazy[rt]) push_down(rt, r - l + 1);
int m = (l + r) >> 1;
if (L <= m) update(L, R, delta, lchild);
if (R > m) update(L, R, delta, rchild);
push_up(rt);
}
int query(int L, int R, int rt = 1, int l = 1, int r = N) {
if (L <= l && r <= R) return tree[rt];
if (lazy[rt]) push_down(rt, r - l + 1);
int m = (l + r) >> 1, ret = 0;
if (L <= m) ret += query(L, R, lchild);
if (R > m) ret += query(L, R, rchild);
return ret;
}
int main()
{
int t;
scanf("%d",&t);
int id=1;
while(t--)
{
met(tree,0);
met(lazy,0);
scanf("%d",&N);
build();
int m;
scanf("%d",&m);
while(m--)
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
update(x,y,z);
}
printf("Case %d: The total value of the hook is %d.\n",id++,query(1,N));
}
}
5.poj 2777
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define met(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
typedef long long ll;
const int maxn = 100000+10;
struct node
{
int left,right;
int color;
int lazy;
}tree[maxn<<2];
void push_up(int root)
{
if(tree[root].left==tree[root].right)
return;
tree[root].color=tree[root<<1].color|tree[root<<1|1].color;
return;
}
void push_down(int root)
{
if(tree[root].left==tree[root].right)
return;
if(tree[root].lazy==0)
return;
tree[root<<1].lazy=tree[root<<1|1].lazy=tree[root].lazy;
tree[root<<1].color=tree[root].color;
tree[root<<1|1].color=tree[root].color;
tree[root].lazy=0;
return;
}
void build(int left,int right,int root)
{
tree[root].left=left,tree[root].right=right;
tree[root].color=1,tree[root].lazy=0;
if(left==right)
return;
int mid=(left+right)>>1;
build(left,mid,root<<1),build(mid+1,right,root<<1|1);
}
void updata(int l,int r,int delta,int root)
{
if(tree[root].left==l&&tree[root].right==r)
{
tree[root].color=1<<(delta-1);
tree[root].lazy=delta;
return;
}
push_down(root);
int mid=(tree[root].left+tree[root].right)>>1;
if(r<=mid) updata(l,r,delta,root<<1);
else if(l>mid) updata(l,r,delta,root<<1|1);
else {
updata(l,mid,delta,root<<1);
updata(mid+1,r,delta,root<<1|1);
}
push_up(root);
}
int query(int l,int r,int root)
{
if(tree[root].left==l&&tree[root].right==r)
return tree[root].color;
push_down(root);
int mid=(tree[root].left+tree[root].right)>>1;
if(r<=mid) return query(l,r,root<<1);
else if(l>mid) return query(l,r,root<<1|1);
else return query(l,mid,root<<1)|query(mid+1,r,root<<1|1);
}
int change(int num)
{
int ans=0;
while(num)
{
ans+=num%2;
num/=2;
}
return ans;
}
int main()
{
int N,T,O;
while(scanf("%d%d%d",&N,&T,&O)!=EOF)
{
build(1,N,1);
while(O--)
{
char s[100];
int x,y;
scanf("%s%d%d",s,&x,&y);
if(x>y)
swap(x,y);
if(s[0]=='C')
{
int delta;
scanf("%d",&delta);
updata(x,y,delta,1);
}
else
{
printf("%d\n",change(query(x,y,1)));
}
}
}
}
6.poj 3468
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define met(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
typedef long long ll;
const int maxn = 1e5+10;
struct node
{
ll left,right;
ll sum,lazy;
}tree[maxn<<2];
ll ans;
void push_up(ll root)
{
tree[root].sum=tree[root<<1].sum+tree[root<<1|1].sum;
}
void push_down(ll root)
{
tree[root<<1].lazy+=tree[root].lazy;;
tree[root<<1|1].lazy+=tree[root].lazy;
tree[root<<1].sum+=tree[root].lazy*(tree[root<<1].right-tree[root<<1].left+1);
tree[root<<1|1].sum+=tree[root].lazy*(tree[root<<1|1].right-tree[root<<1|1].left+1);
tree[root].lazy=0;
}
void build(ll left,ll right,ll root)
{
tree[root].left=left,tree[root].right=right;
tree[root].lazy=0;
if(left==right)
{
scanf("%lld",&tree[root].sum);
return;
}
ll mid=(left+right)>>1;
build(left,mid,root<<1);
build(mid+1,right,root<<1|1);
push_up(root);
}
void updata(ll left,ll right,ll delta,ll root)
{
if(right<tree[root].left||left>tree[root].right) return;
if(left<=tree[root].left&&right>=tree[root].right)
{
tree[root].sum+=delta*(tree[root].right-tree[root].left+1);
tree[root].lazy+=delta;
return;
}
if(tree[root].lazy) push_down(root);
updata(left,right,delta,root<<1);
updata(left,right,delta,root<<1|1);
push_up(root);
}
void query(ll left,ll right,ll root)
{
if(left>tree[root].right||right<tree[root].left) return;
if(left<=tree[root].left&&right>=tree[root].right)
{
ans+=tree[root].sum;
return;
}
if(tree[root].lazy) push_down(root);
ll mid=(tree[root].left+tree[root].right)>>1;
if(mid>=right) query(left,right,root<<1);
else if(mid<left) query(left,right,root<<1|1);
else
{
query(left,mid,root<<1);
query(mid+1,right,root<<1|1);
}
}
int main()
{
int N,Q;
scanf("%d%d",&N,&Q);
met(tree,0);
build(1,N,1);
char s[10];
ll x,y;
while(Q--)
{
scanf("%s%lld%lld",s,&x,&y);
if(s[0]=='Q')
{
ans=0;
query(x,y,1);
printf("%lld\n",ans);
}
else
{
ll delta;
scanf("%lld",&delta);
updata(x,y,delta,1);
}
}
}
7.hdu 2795
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define met(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
typedef long long ll;
const int maxn = 2e5+10;
struct node
{
int left,right;
int data;
}tree[maxn<<2];
int h,w,n;
void push_up(int root)
{
tree[root].data=max(tree[root<<1].data,tree[root<<1|1].data);
}
void build(int root,int left,int right)
{
tree[root].left=left;
tree[root].right=right;
if(tree[root].left==tree[root].right)
{
tree[root].data=w;
return;
}
int mid=(left+right)>>1;
build(root<<1,left,mid);
build(root<<1|1,mid+1,right);
push_up(root);
}
void updata(int root,int pos)
{
if(tree[root].left==tree[root].right)
{
printf("%d\n",tree[root].left);
tree[root].data-=pos;
return;
}
if(tree[root*2].data>=pos)
updata(root<<1,pos);
else
updata(root<<1|1,pos);
push_up(root);
}
int main()
{
while (scanf("%d%d%d",&h,&w,&n)!=EOF)
{
if(h>n)
h=n;
build(1,1,h);
while(n--)
{
int num;
scanf("%d",&num);
if(tree[1].data>=num)
updata(1,num);
else
printf("-1\n");
}
}
}