Can you answer these queries?-HDU4027 区间开方

【Can you answer these queries?-HDU4027 区间开方】的更多相关文章

Can you answer these queries?-HDU4027 区间开方

题意: 给你n个数,两个操作,0为区间开方,1为区间求和链接:http://acm.hdu.edu.cn/showproblem.php?pid=4027 思路: 如果当该区间的数都为1,我们没必要进行开方操作,因为1开方还是1,否则找到每个叶子节点,进行开方操作代码: #include <iostream> #include <algorithm> #include <cmath> #include <cstdio> #include <cstd…

Can you answer these queries?---hdu4027

题目链接有n个数:当操作为1时求L到R的和: 当操作为0时更新L到R为原来的平方根: 不过如果仔细演算的话会发现一个2^64数的平方根开8次也就变成了 1,所以也更新不了多少次,所以可以每次更新到底.. #include<stdio.h> #include<string.h> #include<algorithm> #include<math.h> #include<iostream> #define INF 0xfffffff #define…

（线段树区间查询更新） Can you answer these queries? -- hdu--4027

链接: http://acm.hdu.edu.cn/showproblem.php?pid=4027 分析:因为这个操作是把一个数变成平方根,所以显得略棘手,不过如果仔细演算的话会发现一个2^64数的平方根开8次也就变成了 1,所以也更新不了多少次,所以可以每次更新到底.. 注意:给的X Y大小未知,会出现X > Y的情况代码: #include<cstdio> #include<cmath> #include<cstring> #include<cstd…

HDU 4027—— Can you answer these queries?——————【线段树区间开方，区间求和】

Can you answer these queries? Time Limit:2000MS Memory Limit:65768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 4027 Description A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use…

HDU 4027 Can you answer these queries?（线段树区间开方）

Can you answer these queries? Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 16260 Accepted Submission(s): 3809 Problem Description A lot of battleships of evil are arranged in a line befor…

HDU4027 Can you answer these queries? —— 线段树区间修改

题目链接:https://vjudge.net/problem/HDU-4027 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. F…