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

原创 2015年11月21日 19:50:02

Can you answer these queries?

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


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 263.
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
Case #1: 19 7 6

快恶心死的一道题,本来是没看懂题意的,不小心看漏了题目,然后不知道如何下手做.....

然后最后才意识到是区间要开平方.....英语啊....

其他就是最经典的区间求和了.....

然后是一直超时.....原来是在某一区间全部取值为1 的时候,就不需要全部更新了,这样能省去很多时间的操作............

然后pe 忘了空行............

真应该涨点教训。,这样下去可就真废了..........

最近状态不好,太忙了都,好好整顿整顿吧.....



#include<stdio.h>
#include<algorithm>
#include<math.h>
using namespace std;
typedef long long ll;
ll sum[400005];int k=0;
void build(int rt,int l,int r)
{
	if(l==r)
	{
		scanf("%lld",&sum[rt]);
		return;
	}
	int mid=(l+r)>>1,tp=rt<<1;
	build(tp,l,mid);build(tp|1,mid+1,r);
	sum[rt]=sum[tp]+sum[tp|1];
}
void update(int rt,int l,int r,int a,int b)
{
	if(sum[rt]==r-l+1)//如果这个区间全部为 1 
	{
		return;
	}
	if(l==r)
	{
		sum[rt]=sqrt((double)sum[rt]);//注意
		return;
	}
	int mid=(l+r)>>1,tp=rt<<1;ll res=0;
	if(mid>=a)
	{
		update(tp,l,mid,a,b);
	}
	if(mid<b)
	{
		update(tp|1,mid+1,r,a,b);
	}
	sum[rt]=sum[tp]+sum[tp|1];
}

ll find(int rt,int l,int r,int a,int b)
{
	if(l>=a&&r<=b)
	{
		return sum[rt];
	}
	int mid=(l+r)>>1,tp=rt<<1;ll res=0;
	if(mid>=a)
	{
		res+=find(tp,l,mid,a,b);
	}
	if(mid<b)
	{
		res+=find(tp|1,mid+1,r,a,b);
	}
	return res;
}

int main()
{
	int n,m;
	//freopen("shuju.txt","r",stdin);
	while(~scanf("%d",&n))
	{
		build(1,1,n);
		printf("Case #%d:\n",++k);
		scanf("%d",&m);
		while(m--)
		{
			int kase,a,b;
			scanf("%d%d%d",&kase,&a,&b);
			if(a>b)
			{
				swap(a,b);
			}
			if(!kase)
			{
				update(1,1,n,a,b);
			}
			else
			{
				printf("%lld\n",find(1,1,n,a,b));
			}
		}
		printf("\n");
	}
	return 0;
}






版权声明:本文为博主原创文章,未经博主允许不得转载。

hdu 4027Can you answer these queries?(线段树功能:平方减少,区间求和)

hdu 4027Can you answer these queries?(线段树功能:平方减少,区间求和) 杭电ACM2014暑期集训队——名单公示  百度之星编程大赛——您报名了吗? ...
  • u012860063
  • u012860063
  • 2014年05月11日 18:50
  • 1238

SPOJ 1043 Can you answer these queries I 求任意区间最大连续子段和 线段树

题目链接:点击打开链接 维护区间左起连续的最大和,右起连续的和。。 #include #include #include #include #include #include #inclu...
  • qq574857122
  • qq574857122
  • 2014年08月18日 23:16
  • 1500

Spoj 2916 Can you answer these queries V 线段树 求任意重叠区间的最大子段和

题目链接:点击打开链接 题意: T个测试数据 n个数字 q个询问 每个询问 : [x1, y1] [x2, y2]  问: int ans = -inf; for(int i = x1; i ...
  • qq574857122
  • qq574857122
  • 2014年09月01日 16:20
  • 1191

HDU-4027-Can you answer these queries? (线段树,区间开平方,区间求和)

题目链接:HDU-4027-Can you answer these queries? 一个数最多开平方8次,所以加个剪枝,当区间和等于区间元素数时,不再递归下去, 然后要注意eps开大一点,...
  • jinglinxiao
  • jinglinxiao
  • 2017年01月15日 18:15
  • 200

hdu4027 Can you answer these queries?(线段树平方减少,区间求和)

线段树平方减少,区间求和)
  • u012860063
  • u012860063
  • 2014年06月29日 15:20
  • 980

hdoj 4027 Can you answer these queries? 【线段树 区间减为平方 + 区间求和】

Can you answer these queries? Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65768/65768 K ...
  • chenzhenyu123456
  • chenzhenyu123456
  • 2015年10月11日 20:17
  • 402

HDU4027 Can you answer these queries?(线段树区间更新,区间开根号)

题目: Can you answer these queries? Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65768/65...
  • riba2534
  • riba2534
  • 2017年08月05日 15:47
  • 144

hdu4027Can you answer these queries?【线段树区间更新区间求和】

Problem Description A lot of battleships of evil are arranged in a line before the battle. Our comm...
  • zhou_yujia
  • zhou_yujia
  • 2016年03月07日 21:33
  • 357

hdu 4027 Can you answer these queries?(线段树——区间更新)(思路)

Can you answer these queries?Problem Description A lot of battleships of evil are arranged in a lin...
  • blessLZH0108
  • blessLZH0108
  • 2017年04月24日 21:51
  • 276

HDU 4027 Can you answer these queries? (线段树 区间更新)

题目地址:点击打开链接 题意:给定100000个数,两种操作,0 i j表示将i j这段的数字都开根号(向下取整),1 i j表示查询i j之间的所有值的和(所有的和都不超过64位) ...
  • CillyB
  • CillyB
  • 2017年03月14日 22:43
  • 210
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 4027 Can you answer these queries?【线段树】区间开平方,区间求和
举报原因:
原因补充:

(最多只允许输入30个字)