hdu 4288 Coder 线段树 区间合并

Coder

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4749    Accepted Submission(s): 1808

Problem Description

　　In mathematics and computer science, an algorithm describes a set of procedures or instructions that define a procedure. The term has become increasing popular since the advent of cheap and reliable computers. Many companies now employ a single coder to write an algorithm that will replace many other employees. An added benefit to the employer is that the coder will also become redundant once their work is done.  ¹
　　You are now the signle coder, and have been assigned a new task writing code, since your boss would like to replace many other employees (and you when you become redundant once your task is complete).
Your code should be able to complete a task to replace these employees who do nothing all day but eating: make the digest sum.
　　By saying “digest sum” we study some properties of data. For the sake of simplicity, our data is a set of integers. Your code should give response to following operations:
　　1. add x – add the element x to the set;
　　2. del x – remove the element x from the set;
　　3. sum – find the digest sum of the set. The digest sum should be understood by

　　where the set S is written as {a ₁, a ₂, ... , a _k} satisfying a ₁ < a ₂ < a ₃ < ... < a _k 
　　Can you complete this task (and be then fired)?
------------------------------------------------------------------------------
¹ See http://uncyclopedia.wikia.com/wiki/Algorithm

 

Input

　　There’re several test cases.
　　In each test case, the first line contains one integer N ( 1 <= N <= 10 ⁵ ), the number of operations to process.
　　Then following is n lines, each one containing one of three operations: “add x” or “del x” or “sum”.
　　You may assume that 1 <= x <= 10 ⁹.
　　Please see the sample for detailed format.
　　For any “add x” it is guaranteed that x is not currently in the set just before this operation.
　　For any “del x” it is guaranteed that x must currently be in the set just before this operation.
　　Please process until EOF (End Of File).

 

Output

　　For each operation “sum” please print one line containing exactly one integer denoting the digest sum of the current set. Print 0 if the set is empty.

 

Sample Input

  
  

   
   9
add 1
add 2
add 3
add 4
add 5
sum
add 6
del 3
sum
6
add 1
add 3
add 5
add 7
add 9
sum
  
  

 

Sample Output

  
  

   
   3
4
5

   
   

    
    

     
     Hint
    
    
C++ maybe run faster than G++ in this problem.
   
   
   
    
  
  

 

Source

2012 ACM/ICPC Asia Regional Chengdu Online

 

Recommend

liuyiding   |   We have carefully selected several similar problems for you:   4297  4289  4290  4291  4292 

1.通过最近几个题发现，线段树可以解决在连续区间内一共存在多少个值的问题（某些点存在，某一点不存在）

查询的时候既可以查询出某一段区间的sum之和，又可以在一段连续，却不一定每个点都存在的区间上，去统计找到k个值的位置。

线段树的灵活运用在于update的顺序性。

2.

该题目区间合并的方式：

 void merge(int ind)
    {
        int c=tree[ind*2].sum;
        for(int i=0;i<5;i++)  tree[ind].mod[i]=tree[ind*2].mod[i];
        for(int i=0;i<5;i++)  tree[ind].mod[(i+c)%5]+=tree[ind*2+1].mod[i];
    }

 因为 题目所求是排序后序数  %5=3的元素之和。

3.

STL技能：vector删重:

ve.erase(unique(ve.begin(),ve.end()),ve.end());

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
#include<cctype>
#include<utility>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI (4.0*atan(1.0))
#define eps 1e-10
#define sqr(x) ((x)*(x))
#define FOR0(i,n)  for(int i=0 ;i<(n) ;i++)
#define FOR1(i,n)  for(int i=1 ;i<=(n) ;i++)
#define FORD(i,n)  for(int i=(n) ;i>=0 ;i--)
#define  lson   ind<<1,le,mid
#define rson    ind<<1|1,mid+1,ri
#define MID   int mid=(le+ri)>>1
#define zero(x)((x>0? x:-x)<1e-15)
#define mk    make_pair
#define _f     first
#define _s     second
using namespace std;
//const int INF=    ;
typedef long long ll;
//const ll inf =1000000000000000;//1e15;
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//fin.close();
//fout.close();
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
const int INF =0x3f3f3f3f;
const int maxn= 100000+20   ;
//const int maxm=    ;
map<int ,int >mp;
int m,n;
char s[12];
vector<int > ve;

struct Query
{
    int type;
    int x;
}q[maxn];
void read(int ind)
{
    scanf("%s",s);
    if(s[0]=='s') q[ind].type=0;
    else
        {
            scanf("%d",&q[ind].x);

            if(s[0]=='a')    { q[ind].type=1;ve.push_back(q[ind].x);}
            else if(s[0]=='d')     q[ind].type=-1;
       }

}


struct Node
{
    int  le,ri,sum;
    ll mod[5];
    int mid(){return (le+ri)/2;}
    void init()
    {
        for(int i=0;i<5;i++)  mod[i]=0;
        sum=0;
    }
    void change()
    {
        if(!sum)  mod[1]=0;
        else mod[1]=ve[le];
    }
}tree[4*maxn];

struct segmentTree
{

    void build(int ind,int le,int ri)
    {
        tree[ind].le=le;
        tree[ind].ri=ri;
        tree[ind].init();
        if(le==ri)
        {
           return;
        }
        MID;
        build(lson);
        build(rson);
    }
    void merge(int ind)
    {
        int c=tree[ind*2].sum;
        for(int i=0;i<5;i++)  tree[ind].mod[i]=tree[ind*2].mod[i];
        for(int i=0;i<5;i++)  tree[ind].mod[(i+c)%5]+=tree[ind*2+1].mod[i];

    }

    void update(int ind,int x,int add)
    {
        int le=tree[ind].le,ri=tree[ind].ri;
        tree[ind].sum+=add;
        if(le==ri)
        {
            tree[ind].change();
            return;
        }
        int mid=tree[ind].mid();
        if(x<=mid )  update(ind*2,x,add);
        else update(ind*2+1,x,add);
        merge(ind);

    }


}sgt;



int main()
{

  while(~scanf("%d",&m))
  {
      ve.clear();
      mp.clear();
      for(int i=1;i<=m;i++)
      {
          read(i);
      }
      sort(ve.begin(),ve.end());
      ve.erase(unique(ve.begin(),ve.end()),ve.end());

       n=0;
      for(int i=0;i<ve.size();i++)
      {
          int x=ve[i];
          mp[x]=n++;
      }
      sgt.build(1,0,n);
      for(int i=1;i<=m;i++)
      {
          if(q[i].type==0)  printf("%lld\n",tree[1].mod[3]);
          else   sgt.update(1,mp[q[i].x],q[i].type);
      }



  }

    return 0;
}

2017.7.12:

难点在于合并公式的推导：

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define for0(a, n) for (int (a) = 0; (a) < (n); (a)++)
#define for1(a, n) for (int (a) = 1; (a) <= (n); (a)++)
#define mes(a,x,s)  memset(a,x,(s)*sizeof a[0])
#define mem(a,x)  memset(a,x,sizeof a)
#define ysk(x)  (1<<(x))
#define lson  (ind<<1)
#define rson  (ind<<1|1)
typedef long long ll;
//const int INF = 0x3f3f3f3f ;
const int maxn=100000  ;
int n;
int op[maxn+5],a[maxn+5];
char ch[10];
set<int>se;
map<int,int >mp;
int nex;

struct Node
{
    int le,ri;
    int num;
    ll S[5];

};
struct Segment
{
    Node C[4*maxn];
    void build(int ind,int le,int ri)
    {
        C[ind].le=le,C[ind].ri=ri;
        C[ind].num=0;
        for0(i,5) C[ind].S[i]=0;
        if(le==ri)
        {
            return;
        }
        int mid=(le+ri)>>1;
        build(lson,le,mid);
        build(rson,mid+1,ri);
    }

    void update(int ind,int pos,int x)
    {
        int le=C[ind].le,ri=C[ind].ri;
        if(le==ri)
        {
            if(x>0)
            {
                C[ind].num++;
            }
            else
            {
                C[ind].num--;
            }
            C[ind].S[0]+=x;
            return;
        }

        int mid=(le+ri)>>1;
        if(pos<=mid)  update(lson,pos,x);
        else          update(rson,pos,x);


        C[ind].num=C[lson].num+C[rson].num;
        int st= C[lson].num%5;

        for0(i,5)
        {
            C[ind].S[i]= C[lson].S[i]+C[rson].S[(5-st+i)%5];
        }

    }


}sgt;

void solve()
{
    sgt.build(1,1,n);
    for1(i,n)
    {
        int x=a[i];int pos=mp[x];
        if(op[i]==+1)
        {
            sgt.update(1,pos,+x);
        }
        else if(op[i]==-1)
        {
            sgt.update(1,pos,-x);
        }
        else
        {
            printf("%lld\n",sgt.C[1].S[2]);
        }

    }


}
int main()
{
	std::ios::sync_with_stdio(false);
	while(~scanf("%d",&n))
    {
        se.clear();mp.clear();
        for1(i,n)
        {
            scanf("%s",ch);
            if(ch[0]=='a')      {op[i]=1 ; scanf("%d",&a[i]);se.insert(a[i]);}
            else if(ch[0]=='d') {op[i]=-1; scanf("%d",&a[i]);se.insert(a[i]);}
            else    op[i]=0;
        }
        nex=1;
        for(set<int>::iterator it=se.begin();it!=se.end();it++)
        {
            int x=*it;
            mp[x]=nex++;
        }
        solve();
    }


	return 0;
}
/*
4
add 1
add 2
add 3
sum
*/