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;
}






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

相关文章推荐

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

线段树平方减少,区间求和)

HDU4027 Can you answer these queries?(线段树区间更新求和)

题目: Can you answer these queries? Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 6576...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

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

Problem Description A lot of battleships of evil are arranged in a line before the battle. Our comm...

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...

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

题目地址:点击打开链接 题意:给定100000个数,两种操作,0 i j表示将i j这段的数字都开根号(向下取整),1 i j表示查询i j之间的所有值的和(所有的和都不超过64位) ...

hdu 4027 Can you answer these queries? 求区间N次根的和 线段树

Problem Description A lot of battleships of evil are arranged in a line before the battle. Our comm...

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

题意  输入n个数  然后有两种操作   输入0时将给定区间所有数都变为自己的开方   输入1输出给定区间所有数的和 虽然是区间更新  但每个点更新的不一样  因此只能对单点进行更新  其实一个点最多...
  • acvay
  • acvay
  • 2015-04-19 09:34
  • 1166

HDU 4027 Can you answer these queries? (线段树 - 区间开根取整)

题意: 给你n 个数, 两种操作,一种区间成段开根号取整,另一种求区间和。 思路: 因为一个数开上大约7,8次 就成1 了, 1在开根号不变了。 因此我们在递归子区间时,如果发现这个区间都是1...

hdu 4027 Can you answer these queries? 线段树区间修改区间查询

题目大意: 对线段树有两种操作,对连续一段整体开根号,对连续一段整体求和。 分析: 这里开根号数会越来越小,到1后根号1==1,不变,可以利用这一点。某段maxv 还有一种优化就是某一段max...
  • Mtrix
  • Mtrix
  • 2016-08-25 10:08
  • 129

HDOJ 4027 Can you answer these queries?(线段树+区间标记)

Can you answer these queries? Time Limit:2000MS     Memory Limit:65768KB     64bit IO Format:%I64d ...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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