线段树特殊标记hdu4027（网络赛）

u010660276

于 2014-08-03 22:12:50 发布

阅读量537

点赞数

分类专栏：树状数组/线段树

本文链接：https://blog.csdn.net/u010660276/article/details/38361915

版权

树状数组/线段树专栏收录该内容

143 篇文章 0 订阅

订阅专栏

Online Judge	Online Exercise	Online Teaching	Online Contests	Exercise Author
F.A.Q Hand In Hand Online Acmers Forum \| Discuss Statistical Charts	Problem Archive Realtime Judge Status Authors Ranklist	C/C++/Java Exams ACM Steps Go to Job Contest LiveCast ICPC@China	Best Coder ^beta VIP \| STD Contests Virtual Contests DIY \| Web-DIY ^beta Recent Contests	lee Mail 0 (0) Control Panel Sign Out

即将截止！！！【BestCoder Round #3】8月3号19:00~21:00（赛前30分钟停止注册比赛）
不熟悉BestCoder的比赛？看看这里—>《BestCoder用户手册》下载链接

Can you answer these queries?

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 8298 Accepted Submission(s): 1897

Problem Description

A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be marked a value of endurance. For every attack of our secret weapon, it could decrease the endurance of a consecutive part of battleships by make their endurance to the square root of it original value of endurance. During the series of attack of our secret weapon, the commander wants to evaluate the effect of the weapon, so he asks you for help.
You are asked to answer the queries that the sum of the endurance of a consecutive part of the battleship line.

Notice that the square root operation should be rounded down to integer.

Input

The input contains several test cases, terminated by EOF.
  For each test case, the first line contains a single integer N, denoting there are N battleships of evil in a line. (1 <= N <= 100000)
  The second line contains N integers Ei, indicating the endurance value of each battleship from the beginning of the line to the end. You can assume that the sum of all endurance value is less than 2 ⁶³.
  The next line contains an integer M, denoting the number of actions and queries. (1 <= M <= 100000)
  For the following M lines, each line contains three integers T, X and Y. The T=0 denoting the action of the secret weapon, which will decrease the endurance value of the battleships between the X-th and Y-th battleship, inclusive. The T=1 denoting the query of the commander which ask for the sum of the endurance value of the battleship between X-th and Y-th, inclusive.

Output

For each test case, print the case number at the first line. Then print one line for each query. And remember follow a blank line after each test case.

Sample Input

      
      
       
       10
1 2 3 4 5 6 7 8 9 10
5
0 1 10
1 1 10
1 1 5
0 5 8
1 4 8

Sample Output

思路：每次更新是对这个区间的所有的数开平方，从2^64开平方一直开尽（由于是开方取整），所以开6次即可。维护一个setv，如果这一段已经成了1就不用再往下走了

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
const int maxn=100010;
typedef long long LL;

int N,M;
LL a[maxn];

struct IntervalTree
{
    LL val[maxn<<3];
    int setv[maxn<<3];
    void build(int o,int l,int r)
    {
        val[o]=setv[o]=0;
        if(l==r)
        {
            val[o]=a[l];
            return;
        }
        int mid=(l+r)>>1;
        build(o<<1,l,mid);
        build(o<<1|1,mid+1,r);
        pushup(o);
    }

    void pushup(int o)
    {
        val[o]=val[o<<1]+val[o<<1|1];
        setv[o]=setv[o<<1]&&setv[o<<1|1];
    }

    void update(int o,int l,int r,int q1,int q2)
    {
        if(setv[o])return;
        if(l==r)
        {
            val[o]=sqrt(val[o]);
            if(val[o]<=1)setv[o]=1;
            return;
        }
        int mid=(l+r)>>1;
        if(q1<=mid)update(o<<1,l,mid,q1,q2);
        if(q2>mid)update(o<<1|1,mid+1,r,q1,q2);
        pushup(o);
    }

    LL query(int o,int l,int r,int q1,int q2)
    {
        if(q1<=l&&r<=q2)return val[o];
        int mid=(l+r)>>1;
        LL ans=0;
        if(q1<=mid)ans+=query(o<<1,l,mid,q1,q2);
        if(q2>mid)ans+=query(o<<1|1,mid+1,r,q1,q2);
        return ans;
    }

}tree;

int main()
{
    int cas=1;
    while(scanf("%d",&N)!=EOF)
    {
        for(int i=1;i<=N;i++)scanf("%I64d",&a[i]);
        scanf("%d",&M);
        int T,X,Y;
        tree.build(1,1,N);
        printf("Case #%d:\n",cas++);
        while(M--)
        {
            scanf("%d%d%d",&T,&X,&Y);
            if(X>Y)swap(X,Y);
            if(T==0)tree.update(1,1,N,X,Y);
            else printf("%I64d\n",tree.query(1,1,N,X,Y));
        }
        printf("\n");
    }
    return 0;
}