http://acm.hdu.edu.cn/showproblem.php?pid=1754
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 126144 Accepted Submission(s): 46353 Problem Description 很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。
Input 本题目包含多组测试,请处理到文件结束。
Output 对于每一次询问操作,在一行里面输出最高成绩。
Sample Input 5 6 1 2 3 4 5 Q 1 5 U 3 6 Q 3 4 Q 4 5 U 2 9 Q 1 5
Sample Output 5 6 5 9 Hint Huge input,the C function scanf() will work better than cin
Author linle
|
稍微改一下模板就行了
#include<bits/stdc++.h>
using namespace std;
const int N = 200005;
int a[N];
struct node
{
int l, r, sum;
}t[N<<2];
void build(int x, int l, int r)
{
t[x].l = l, t[x].r = r;
if(l == r)
{
t[x].sum = a[l];
return ;
}
int mid = (l + r) >> 1;
build(x<<1, l, mid);
build(x<<1|1, mid+1, r);
t[x].sum = max(t[x<<1].sum, t[x<<1|1].sum);
}
void update(int x, int no, int k)
{
if(t[x].l == t[x].r)
{
t[x].sum = k;
return ;
}
int mid = (t[x].l + t[x].r) >> 1;
if(no <= mid) update(x<<1, no, k);
if(no > mid) update(x<<1|1, no, k);
t[x].sum = max(t[x<<1].sum, t[x<<1|1].sum);
}
int query(int x, int l, int r)
{
if(l <= t[x].l && t[x].r <= r) return t[x].sum;
int mid = (t[x].l + t[x].r) >> 1, k1 = -1, k2 = -1;
if(l <= mid) k1 = query(x<<1, l, r);
if(r > mid) k2 = query(x<<1|1, l, r);
return max(k1, k2);
}
int main()
{
int n, m;
while(cin >> n >> m)
{
for(int i = 1; i <= n; i++)
scanf("%d", a+i);
build(1, 1, n);
char c; int x, y;
while(m--)
{
// scanf("%c%d%d", &c, &x, &y);
cin >> c >> x >> y;
if(c == 'Q')
cout << query(1, x, y) << endl;
else
update(1, x, y);
}
}
return 0;
}