HDU 1166

最新推荐文章于 2025-10-19 17:19:10 发布

阿豪boy

最新推荐文章于 2025-10-19 17:19:10 发布

阅读量101

点赞数

CC 4.0 BY-SA版权

文章标签：算法动态规划密码学 templates icpc

本文链接：https://blog.csdn.net/qq_35516360/article/details/122067326

本文介绍了树状数组和线段树两种数据结构的基本原理及其实现方法，并通过具体示例展示了如何使用这两种数据结构来解决区间更新与查询等问题。

原文链接: HDU 1166

上一篇: HDU 1257

下一篇: HDU 1561 依赖背包

树状数组

#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>

#define LL long long

int const MAX = 1e6+1;

using namespace std;
int c[MAX],a[MAX];

int n;
int lowbit(int x)
{
        return x&(-x);
}
int sum(int n)
{
        int sum=0;
        while(n>0)
        {
                sum+=c[n];
                n=n-lowbit(n);
        }
        return sum;
}

void change(int i,int x)
{
        while(i<=n)
        {
                c[i]=c[i]+x;
                i=i+lowbit(i);
        }
}
int main(int argc, char *argv[])
{
        // freopen("in.txt","r",stdin);
        // freopen("out.txt","w",stdout);

        int T;
        scanf("%d",&T );
        int cas=1;
        while (T--) {
                printf("Case %d:\n",cas++);

                memset(c,0,sizeof(c));
                scanf("%d", &n);

                for(int i=1; i<=n; i++) {
                        scanf("%d",a+i );
                        change(i,a[i]);
                }
                char opt[11];
                int x,y;
                while ( scanf("%s",opt)==1 ) {
                        if(opt[0]=='E')
                                break;
                        scanf("%d %d", &x,&y );
                        if(opt[0]=='Q') {
                                printf("%d\n",sum(y)-sum(x-1));
                        }else if(opt[0]=='A') {
                                change(x,y);
                        }else if(opt[0]=='S') {
                                change(x,-y);
                        }
                }
        }
        return 0;
}

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

int c[100005];
int n,m;

int lowbit(int a)
{
        return a& -a;
}

void add(int i,int a)
{
        for(; i<=n; i+=lowbit(i)) c[i]+=a;
}

int sum(int a)
{
        int ans=0;
        for(; a>0; a-=lowbit(a))
                ans+=c[a];
        return ans;
}

int main()
{
        int t;
        int i,j,cas;
        int a,b;
        char st[10];
        scanf("%d",&t);
        for(cas=1; cas<=t; cas++)
        {
                memset(c,0,sizeof c);
                scanf("%d",&n);
                for(i=1; i<=n; i++)
                {
                        scanf("%d",&a);
                        add(i,a);
                }
                printf("Case %d:\n",cas);
                for(;; )
                {
                        scanf("%s",st);
                        if(st[0]=='E')
                                break;
                        scanf("%d%d",&a,&b);
                        if(st[0]=='A')
                                add(a,b);
                        if(st[0]=='S')
                                add(a,-b);
                        if(st[0]=='Q')
                                printf("%d\n",sum(b)-sum(a-1));
                }

        }
        return 0;
}

/*树状数组模板题*/
#include<iostream>
#include<cstdio>
#include<cstring>
#define MAXN 50005
using namespace std;
int que[MAXN],c[MAXN];
char chr[10];
int lowbit(int x)
{
    return x&(-x);//用来计算a^k中的k
}
//实现每个树状数组元素所分管的元素之和的计算
void create(int n)
{
    int i,s,j;
    for(i=1;i<=n;i++)
    {
        s=lowbit(i);
        for(j=0;j<s;j++)//含自身向前推s个
        {
            c[i]=c[i]+que[i-j];
        }
    }
}
//求数组的和的算法如下
int sum(int n)
{
    int s=0;
    while(n>0)
    {
        s+=c[n];
        n=n-lowbit(n);
    }
    return s;
}
//修改操作，往上修改
void change(int i,int n,int x)
{
    while(i<=n)
    {
        c[i]=c[i]+x;
        i=i+lowbit(i);
    }
}
int main()
{
    int t,cas=1,i,j,n,x,s,a,b;
    cin>>t;
    while(t--)
    {
        memset(c,0,sizeof(c));
        cin>>n;
        for(i=1;i<=n;i++)
            scanf("%d",&que[i]);
        create(n);
        cout<<"Case "<<cas++<<":"<<endl;
        while(1)
        {
            scanf("%s",chr);
            if(!strcmp(chr,"Add"))
            {
                scanf("%d%d",&j,&x);
                change(j,n,x);
            }
            else if(!strcmp(chr,"Sub"))
            {
                scanf("%d%d",&j,&x);
                change(j,n,-x);
            }
            else if(!strcmp(chr,"Query"))
            {
                scanf("%d%d",&a,&b);
                s=sum(b)-sum(a-1);
                printf("%d\n",s);
            }
            else
                break;
        }
    }
    return 0;
}

线段树

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;

int n,m;
int num[100005];

struct H
{
    int l,r,sum;
}trees[300005];

void build_trees(int jd,int l,int r)
{
    trees[jd].l=l;
    trees[jd].r=r;
    if(l==r)
        {trees[jd].sum=num[l];return ;}
    int mid = (l+r)/2;
    build_trees(jd*2,l,mid);
    build_trees(jd*2+1,mid+1,r);
    trees[jd].sum=trees[jd*2].sum+trees[jd*2+1].sum;
}

void update(int jd,int a,int b)
{
    if(trees[jd].l==trees[jd].r)
        trees[jd].sum+=b;
    else {
        int mid = (trees[jd].l+trees[jd].r)/2;
        if(a<=mid) update(jd*2,a,b);
        else update(jd*2+1,a,b);
        trees[jd].sum=trees[jd*2].sum+trees[jd*2+1].sum;
    }
}

int query(int jd , int l,int r)
{
    if(l<=trees[jd].l&&r>=trees[jd].r)
        return trees[jd].sum;
    int ans=0;
    int mid = (trees[jd].l+trees[jd].r)/2;
    if(l<=mid) ans+=query(jd*2,l,r);
    if(r>mid)  ans+=query(jd*2+1,l,r);
    return ans;
}

int main()
{
    int t;
    int i,j,cas;
    int a,b;
    char st[10];
    scanf("%d",&t);
    for(cas=1;cas<=t;cas++)
    {
        memset(num,0,sizeof num);
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        {
            scanf("%d",&num[i]);
        }
        build_trees(1,1,n);
        printf("Case %d:\n",cas);
        for(;;)
        {
            scanf("%s",st);
            if(st[0]=='E')
                break;
            scanf("%d%d",&a,&b);
            if(st[0]=='A')
                update(1,a,b);
            if(st[0]=='S')
                update(1,a,-b);
            if(st[0]=='Q')
                printf("%d\n",query(1,a,b));
        }

    }
    return 0;
}

#include<cstring>  
#include<iostream>  
  
#define M 50005  
#define lson l,m,rt<<1  
#define rson m+1,r,rt<<1|1  
/*left,right,root,middle*/  
  
int sum[M<<2];  
  
inline void PushPlus(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 m = ( l + r )>>1;  
  
    Build(lson);  
    Build(rson);  
    PushPlus(rt);  
}  
  
void Updata(int p, int add, int l, int r, int rt)  
{  
  
    if( l == r )  
    {  
        sum[rt] += add;  
        return ;  
    }  
    int m = ( l + r ) >> 1;  
    if(p <= m)  
        Updata(p, add, lson);  
    else  
        Updata(p, add, rson);  
  
    PushPlus(rt);  
}  
  
int Query(int L,int R,int l,int r,int rt)  
{  
    if( L <= l && r <= R )  
    {  
        return sum[rt];  
    }  
    int m = ( l + r ) >> 1;  
    int ans=0;  
    if(L<=m )  
        ans+=Query(L,R,lson);  
    if(R>m)  
        ans+=Query(L,R,rson);  
  
    return ans;  
}  
int main()  
{     
    int T, n, a, b;  
    scanf("%d",&T);  
    for( int i = 1; i <= T; ++i )  
    {  
        printf("Case %d:\n",i);  
        scanf("%d",&n);  
        Build(1,n,1);  
  
        char op[10];  
  
        while( scanf("%s",op) &&op[0]!='E' )  
        {  
  
            scanf("%d %d", &a, &b);  
            if(op[0] == 'Q')  
                printf("%d\n",Query(a,b,1,n,1));  
            else if(op[0] == 'S')  
                Updata(a,-b,1,n,1);  
            else  
                Updata(a,b,1,n,1);  
  
        }  
    }  
    return 0;  
}