2018HDU多校二 -F 题 Naive Operations(线段树)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6315

In a galaxy far, far away, there are two integer sequence a and b of length n. 
b is a static permutation of 1 to n. Initially a is filled with zeroes. 
There are two kind of operations: 
1. add l r: add one for al,al+1...aral,al+1...ar 
2. query l r: query ∑ri=l⌊ai/bi⌋∑i=lr⌊ai/bi⌋

InputThere are multiple test cases, please read till the end of input file. 
For each test case, in the first line, two integers n,q, representing the length of a,b and the number of queries. 
In the second line, n integers separated by spaces, representing permutation b. 
In the following q lines, each line is either in the form 'add l r' or 'query l r', representing an operation. 
1≤n,q≤1000001≤n,q≤100000, 1≤l≤r≤n1≤l≤r≤n, there're no more than 5 test cases. 
OutputOutput the answer for each 'query', each one line. 
Sample Input

5 12
1 5 2 4 3
add 1 4
query 1 4
add 2 5
query 2 5
add 3 5
query 1 5
add 2 4
query 1 4
add 2 5
query 2 5
add 2 2
query 1 5

Sample Output

1
1
2
4
4
6

题意：题目给你N个数，Q个操作，另外有个数组a,a 的初始值都是0，然后Q个操作，若是add 则在区间x~y之间的a[]都加一，query 就查找l~r之间   ∑ri=l⌊ai/bi⌋∑i=lr⌊ai/bi⌋；
题解： 由于是取下界，我们可以求每个区间内距离该位置上b[i]值最近的数，然后没加一，就把b[i]减一，如果最小值为零，就出现了a[i]/b[i]==1的情况，就将区间的sum加一，对于
每个查询操作，我们只要求区间的sun和即可；

参考代码：

 #include<bits/stdc++.h>
 using namespace std;
 const int maxn=1e5+;
 int n,q,x,y,b[maxn];
 char str[];

 struct Node{
     int l,r,sum,tag,minnumm;
 } tree[maxn<<];

 void build(int l,int r,int pos)
 {
     tree[pos].l=l,tree[pos].r=r;
     if(l==r)
     {
         tree[pos].minnumm=b[l];
         tree[pos].sum=;
         tree[pos].tag=;
         return ;
     }
     int mid=(l+r)>>;
     build(l,mid,pos<<);
     build(mid+,r,pos<<|);
     tree[pos].minnumm=min(tree[pos<<].minnumm,tree[pos<<|].minnumm);
     tree[pos].sum=tree[pos<<].sum+tree[pos<<|].sum;
     tree[pos].tag=tree[pos<<].tag+tree[pos<<|].tag;
 }

 void pushdown(int pos)
 {
     tree[pos<<].minnumm+=tree[pos].tag;
     tree[pos<<|].minnumm+=tree[pos].tag;
     tree[pos<<].tag+=tree[pos].tag;
     tree[pos<<|].tag+=tree[pos].tag;
     tree[pos].tag=;
 }

 void update(int pos,int l,int r,bool temp)
 {
     if(tree[pos].l==l&&tree[pos].r==r)
     {
         if(temp)
         {
             tree[pos].tag--;
             tree[pos].minnumm--;
         }
         if(tree[pos].minnumm>) return ;
         if(tree[pos].l==tree[pos].r)
         {
             if(tree[pos].minnumm==) tree[pos].minnumm=b[tree[pos].l],tree[pos].sum++;
             return ;
         }
         temp=false;
     }

     if(tree[pos].tag) pushdown(pos);

     int mid=(tree[pos].l+tree[pos].r)>>;
     if(r<=mid) update(pos<<,l,r,temp);
     else if(l>=mid+) update(pos<<|,l,r,temp);
     else update(pos<<,l,mid,temp),update(pos<<|,mid+,r,temp); 

     tree[pos].minnumm=min(tree[pos<<].minnumm,tree[pos<<|].minnumm);
     tree[pos].sum=tree[pos<<].sum+tree[pos<<|].sum;
 }

 int query(int pos,int l,int r)
 {
     if(tree[pos].tag) pushdown(pos);
     if(tree[pos].l==l&&tree[pos].r==r) return tree[pos].sum;
     int mid=(tree[pos].l+tree[pos].r)>>,ans=;
     if(r<=mid) ans+=query(pos<<,l,r);
     else if(l>=mid+) ans+=query(pos<<|,l,r);
     else ans+=query(pos<<,l,mid)+query(pos<<|,mid+,r);
     return ans;
 }

 int main()
 {
     while(~scanf("%d%d",&n,&q))
     {
         for(int i=;i<=n;i++) scanf("%d",b+i);
         build(,n,);
         while(q--)
         {
             scanf("%s%d%d",str,&x,&y);
             if(str[]=='a') update(,x,y,true);
             else if(str[]=='q') printf("%d\n",query(,x,y));
         }
     }
     return ;
 }