Codeforces Round #197 (Div. 2)(d线段树)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
    int a[105],n=0;
    string s;
    cin>>s;
    for(int i=0;i<s.size();i++)
        if(s[i]!='+')a[n++]=s[i]-'0';
    sort(a,a+n);
    for(int i=0;i<n;i++)
        if(i!=n-1)cout<<a[i]<<"+";
        else cout<<a[i];
    return 0;

}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
    long long n,m,x=1,now;
    long long sum=0;
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        cin>>now;
        if(now<x)sum+=n+now-x;
        else sum+=now-x;
        x=now;
    }
    cout<<sum<<endl;
    return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=(1<<17);
struct node
{
    int l,r,num;
}tree[maxn*4];
int a[maxn];
int n,m;
void build(int o,int l,int r,int dep)
{
    tree[o].l=l,tree[o].r=r;
    if(l==r){tree[o].num=a[l];return;}
    int mid=(l+r)/2;
    build(o*2,l,mid,dep-1);
    build(o*2+1,mid+1,r,dep-1);
    if(dep%2==1)tree[o].num=(tree[o*2].num|tree[o*2+1].num);
    else tree[o].num=(tree[o*2].num^tree[o*2+1].num);
}
void update(int pos,int x,int o,int l,int r,int dep)
{
    if(l==r){tree[o].num=x;return;}
    int mid=(l+r)/2;
    if(pos<=mid)update(pos,x,o*2,l,mid,dep-1);
    else update(pos,x,o*2+1,mid+1,r,dep-1);
    if(dep%2==1) tree[o].num=(tree[o*2].num|tree[o*2+1].num);
    else tree[o].num=(tree[o*2].num^tree[o*2+1].num);
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=(1<<n);i++)
        scanf("%d",&a[i]);

    build(1,1,1<<n,n);
    int pos,x;
    while(m--)
    {
        scanf("%d%d",&pos,&x);
        update(pos,x,1,1,(1<<n),n);
        printf("%d\n",tree[1].num);
    }
    return 0;
}