hdu 4027
来源:互联网 发布:中企动力java 编辑:程序博客网 时间:2024/06/07 14:03
Can you answer these queries?
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 12193 Accepted Submission(s): 2892
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.
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.
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
101 2 3 4 5 6 7 8 9 1050 1 101 1 101 1 50 5 81 4 8
Sample Output
Case #1:1976
Source
The 36th ACM/ICPC Asia Regional Shanghai Site —— Online Contest
此题需要开极大的线段树数组,并且要用long long。由于使用sqrt,所以可以利用当节点或区间内值都是1时就不再往下update,也算是lazy思想。
#include<cmath>#include<cstdio>#include<cstdlib>#include<cstring>#include<iostream>using namespace std;long long dur[15040000];inline void pushup(int k){dur[k]=dur[k<<1]+dur[k<<1|1];}inline void build(int s,int t,int k){if(!(s^t)){scanf("%I64d",&dur[k]);return;}int m=(s+t)>>1;build(s,m,k<<1);build(m+1,t,k<<1|1);pushup(k);}inline void update(int s,int t,int k,int l,int r){if(dur[k]==t-s+1)return;if(!(s^t)){dur[k]=sqrt(dur[k]);return;}int m=(s+t)>>1;if(l<=m)update(s,m,k<<1,l,r);if(m<r)update(m+1,t,k<<1|1,l,r);pushup(k);}inline long long query(int s,int t,int k,int l,int r){if(l<=s&&t<=r)return dur[k];int m=(s+t)>>1;long long res=0;if(l<=m)res+=query(s,m,k<<1,l,r);if(m<r)res+=query(m+1,t,k<<1|1,l,r);return res;}int main(){int n,m,cas=0;while(scanf("%d",&n)!=EOF){build(1,n,1);scanf("%d",&m);printf("Case #%d:\n",++cas);for(;m;m--){int T,a,b;scanf("%d%d%d",&T,&a,&b);if(a>b)swap(a,b);if(!T)update(1,n,1,a,b);else printf("%I64d\n",query(1,n,1,a,b));}puts("");}return 0;}
1 0
- HDU 4027
- hdu 4027
- hdu 4027
- HDU 4027
- hdu 4027
- HDU 4027
- HDU 4027
- HDU 4027
- hdu 4027
- [HDU] 4027
- HDU 4027 线段树
- hdu 4027#线段树
- hdu 4027 线段树
- HDU 4027 线段树
- hdu 4027 线段树
- hdu 4027(区间更新)
- HDU 4027 线段树
- hdu
- Android使用BitMap压缩图片(高效加载大图)Code+详解
- Java高级特性之反射机制
- 继承、实现、依赖、关联、聚合、组合的联系与区别
- 每天进步一点点——Linux中的线程局部存储(二)
- word2vec
- hdu 4027
- centos 7,pip安装
- frame,iframe,frameset用法和区别
- Android流量管理实时刷新流量数据
- 简单高效的代码部署方法
- php.ini修改php上传文件大小限制的方法详解
- 6.3、Android Studio的CPU Monitor
- Loadrunner做性能测试:为什么100个用户的响应时间反而比50个用户的响应时间更短?
- 【linux学习笔记】Sublime Text3支持GB2312和GBK编码以及中文输入法