zoukankan      html  css  js  c++  java
  • HDU

    

    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.
    InputThe 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 63. 
      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. 
    OutputFor 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
    Case #1:
    19
    7
    6
    #include<stdio.h>
    #include<iostream>
    #include<algorithm>
    #include<string.h>
    #include<math.h>
    using namespace std;
    struct node
    {
        int l,r,op;
        long long sum;
        int mid()
        {
            return (l+r)/2;
        }
    } tree[100000*4];
    void pushup(int rt)
    {
        tree[rt].sum=tree[rt*2].sum+tree[rt*2+1].sum;
        tree[rt].op=tree[rt*2].op|tree[rt*2+1].op;
    }
    void build(int l,int r,int rt)
    {
        tree[rt].l=l;
        tree[rt].r=r;
        if(l==r)
        {
            scanf("%lld",&tree[rt].sum);
            tree[rt].op=1;
            if(tree[rt].sum<=1)tree[rt].op=0;
            return;
        }
        int m=tree[rt].mid();
    //    if(m<=)
        build(l,m,rt*2);
    //    else
        build(m+1,r,rt*2+1);
        pushup(rt);
    }
    void add(int l,int r,int rt,int a,int b)
    {
        if(l==r)
        {
            tree[rt].sum=(int)sqrt(tree[rt].sum*1.0);
            if(tree[rt].sum<=1)tree[rt].op=0;
            return;
        }
        int m=(l+r)/2;
        if(a<=m&&tree[rt*2].op)add(l,m,rt*2,a,b);
        if(b>m&&tree[rt*2+1].op)add(m+1,r,rt*2+1,a,b);
        pushup(rt);
    }
    long long query(int l,int r,int rt,int a,int b)
    {
    
        if(a<=l&&b>=r)
        {
            return tree[rt].sum;
        }
        long long sum=0;
        int m=(l+r)/2;
        if(a<=m)sum+=query(l,m,rt*2,a,b);
        if(b>m)sum+=query(m+1,r,rt*2+1,a,b);
        return sum;
    }
    int main()
    {
        int n;
        int k=1;
        while(~scanf("%d",&n))
        {
            memset(tree,0,sizeof(tree));
            build(1,n,1);
            int m;
            scanf("%d",&m);
            printf("Case #%d:
    ",k++);
            while(m--)
            {
                int a,b,c;
                scanf("%d%d%d",&a,&b,&c);
                if(b>c)
                    swap(b,c);
                if(a==0)
                {
    
                    add(1,n,1,b,c);
                }
                else
                {
                    printf("%lld
    ",query(1,n,1,b,c));
                }
            }
            printf("
    ");
        }
    }




  • 相关阅读:
    微软官方原版Windows Server 2003 R2下载
    [转]Windows Server 2003/2008 官方VHD转换为VMWARE的VMDK
    [转]Windows Server 2003/2008 原版ISO下载地址
    [转]免重启修改Windows远程桌面3389端口脚本
    [转]VMware 虚拟机硬盘镜像共享(98、ME、2000、2003)
    鹦鹉的性格
    [转]关于工作与生活的转帖
    GB2312 字符串,单字节英文,双字节中文的完整类实现
    越狱第2季14集已经出来了!!
    测试一下Windows live Writer,顺便怀念一下单位以前的几个猫咪。
  • 原文地址:https://www.cnblogs.com/da-mei/p/9053335.html
Copyright © 2011-2022 走看看