hdu 3074 Multiply game(线段树模版)
来源:互联网 发布:sql select 创建表 编辑:程序博客网 时间:2024/05/24 05:04
Multiply game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1093 Accepted Submission(s): 358
Problem Description
Tired of playing computer games, alpc23 is planning to play a game on numbers. Because plus and subtraction is too easy for this gay, he wants to do some multiplication in a number sequence. After playing it a few times, he has found it is also too boring. So he plan to do a more challenge job: he wants to change several numbers in this sequence and also work out the multiplication of all the number in a subsequence of the whole sequence.
To be a friend of this gay, you have been invented by him to play this interesting game with him. Of course, you need to work out the answers faster than him to get a free lunch, He he…
To be a friend of this gay, you have been invented by him to play this interesting game with him. Of course, you need to work out the answers faster than him to get a free lunch, He he…
Input
The first line is the number of case T (T<=10).
For each test case, the first line is the length of sequence n (n<=50000), the second line has n numbers, they are the initial n numbers of the sequence a1,a2, …,an,
Then the third line is the number of operation q (q<=50000), from the fourth line to the q+3 line are the description of the q operations. They are the one of the two forms:
0 k1 k2; you need to work out the multiplication of the subsequence from k1 to k2, inclusive. (1<=k1<=k2<=n)
1 k p; the kth number of the sequence has been change to p. (1<=k<=n)
You can assume that all the numbers before and after the replacement are no larger than 1 million.
For each test case, the first line is the length of sequence n (n<=50000), the second line has n numbers, they are the initial n numbers of the sequence a1,a2, …,an,
Then the third line is the number of operation q (q<=50000), from the fourth line to the q+3 line are the description of the q operations. They are the one of the two forms:
0 k1 k2; you need to work out the multiplication of the subsequence from k1 to k2, inclusive. (1<=k1<=k2<=n)
1 k p; the kth number of the sequence has been change to p. (1<=k<=n)
You can assume that all the numbers before and after the replacement are no larger than 1 million.
Output
For each of the first operation, you need to output the answer of multiplication in each line, because the answer can be very large, so can only output the answer after mod 1000000007.
Sample Input
161 2 4 5 6 330 2 51 3 70 2 5
Sample Output
240420题意:给出n个数,有m个操作,操作有:询问区间[L,R]中所有数的成绩、改变某一个数的值。思路:线段树模版题。在每个结点设一个值保存乘积。AC代码:#include <iostream>#include <algorithm>#include <queue>#include <cstring>#include <cstdio>#define L(rt) (rt<<1)#define R(rt) (rt<<1|1)using namespace std;const int mod=1000000007;const int N=50005;int num[N];struct node{ int l,r; long long ans;}tree[N*4];void build(int l,int r,int rt){ tree[rt].l=l; tree[rt].r=r; if(l==r) { tree[rt].ans=num[l]; return; } int mid=(l+r)>>1; build(l,mid,L(rt)); build(mid+1,r,R(rt)); tree[rt].ans=(tree[L(rt)].ans*tree[R(rt)].ans)%mod;}long long query(int l,int r,int rt){ if(tree[rt].l==l&&tree[rt].r==r) return tree[rt].ans; int mid=(tree[rt].l+tree[rt].r)>>1; if(r<=mid) return query(l,r,L(rt)); else if(l>=mid+1) return query(l,r,R(rt)); else { long long a=query(l,mid,L(rt)); long long b=query(mid+1,r,R(rt)); return (a*b)%mod; }}void update(int val,int loc,int rt){ if(tree[rt].l==loc&&tree[rt].r==loc) { tree[rt].ans=val; return; } if(loc<=tree[L(rt)].r) update(val,loc,L(rt)); if(loc>=tree[R(rt)].l) update(val,loc,R(rt)); tree[rt].ans=(tree[L(rt)].ans*tree[R(rt)].ans)%mod;}int main(){ //freopen("1.txt","r",stdin); int t,n,m; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&num[i]); build(1,n,1); scanf("%d",&m); int op,x,y; while(m--) { scanf("%d%d%d",&op,&x,&y); if(op==0) { long long ans=query(x,y,1); printf("%lld\n",ans%mod); } else update(y,x,1); } } return 0;}
- hdu 3074 Multiply game(线段树模版)
- hdu 3074 Multiply game (线段树)
- HDU 3074 Multiply game (线段树)
- hdu 3074 Multiply game(线段树)
- hdu 3074 Multiply game(线段树)
- HDU 3074 线段树 Multiply game
- hdu 3074 Multiply game(模板级线段树)
- HDU 3074 Multiply game(线段树 单点更新)
- HDU 3074-Multiply game(线段树:单点更新,区间求积)
- HDU 3074 Multiply game(线段树区间乘积,单点更新)
- HDU - 3074 - Multiply game (线段树-单点更新,区间求积)
- hdu 3074 Multiply game(线段树模板题) 解题报告
- 3074 Multiply game(线段树求区间乘积)
- HDU 1754 I Hate It (线段树初步point的修改)HDU 3074 Multiply game (增加同余定理)
- hdu 3074 Multiply game
- hdu 3074 Multiply game
- HDU-3074-Multiply game
- hdu 3074 Multiply game
- linux 下 命令行 mail 发邮件方法
- HQL语句
- 利用黑窗口发送邮件
- 走进WebKit
- 通过代码切换组织
- hdu 3074 Multiply game(线段树模版)
- 读取图片 优化android内存
- hibernate多表关联配置
- DirectBuffer及内存泄漏
- 数位DP+二分搜索——HDU3943 K-th Nya Number
- vpn 服务器linux 客户端windows
- 归并排序 (不采用哨兵) 算法导论2.3-2答案
- 只有apk时robotium测试程序启动相应时间(一)
- Android 9 patch 图片 (.9.png 格式图片) 的特点和制作