HDU3308区间合并+单点更新

网址：http://acm.hdu.edu.cn/showproblem.php?pid=3308
不知为何此题一直WA自认为写的没有错误呀，先保存一下以后改正

#include<iostream>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<map>
#include<queue>
#include<climits>
#include<stdlib.h>
#include<iomanip>
#include<string.h>
#include<cstring>
using namespace std;
/*********************************************/
#define N 200000+5
#define R (rt<<1|1)
#define L (rt<<1)
#define lson l,mid,L
#define rson mid+1,r,R
#define mid (l+r)/2
#define INF 0x3f3f3f3f
#define mem(arr,a) memset(arr,a,sizeof(arr))
#define LL long long int
#define sd1(a) scanf("%d",&a)
#define sd2(a,b) scanf("%d%d",&a,&b)
#define sd3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define pd1(a) printf("%d",a)
#define pd2(a,b) printf("%d%d",a,b)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
/**********************************************/
//快速输入法，与此题无关
int Scan() {
    int res = 0, ch, flag = 0;
    if ((ch = getchar()) == '-')
        flag = 1;
    else if (ch >= '0' && ch <= '9')
        res = ch - '0';
    while ((ch = getchar()) >= '0' && ch <= '9')
        res = res * 10 + ch - '0';
    return flag ? -res : res;
}
void Out(int a) {
    if (a > 9)
        Out(a / 10);
    putchar(a % 10 + '0');
}
/********************************************************/
/*1
10 10
7 7 3 3 5 9 9 8 1 8 
Q 6 6
U 3 4
Q 0 1
Q 0 5
Q 4 7
Q 3 5
Q 0 2
Q 4 6
U 6 10
Q 0 9*/
int t, n, m;
struct node{
    int l, r, m;
    int lmin, rmax;
    int len;
};
node s[N << 2];
void pushup(int rt){
    s[rt].lmin = s[L].lmin;
    s[rt].rmax = s[R].rmax;
    s[rt].l = s[L].l;
    s[rt].r = s[R].r;
    if (s[L].rmax < s[R].lmin){
        if (s[rt].l == s[L].len)s[rt].l += s[R].l;
        if (s[rt].r == s[R].len)s[rt].r += s[L].r;
        s[rt].m = s[L].r + s[R].l;
    }
    s[rt].m = max(s[rt].m, max(s[rt].l, s[rt].r));
}
void build(int l, int r, int rt){
    s[rt].len = r - l + 1;
    if (l == r){
        scanf("%d", &s[rt].lmin);
        s[rt].rmax = s[rt].lmin;
        s[rt].l = s[rt].r = s[rt].m = 1;
        return;
    }
    build(lson);
    build(rson);
    pushup(rt);
}
int query(int a, int b, int l, int r, int rt){
    if (a <= l&&r <= b)
        return s[rt].m;
    if (a <= mid&&mid < b){
        int v1 = query(a, b, lson);
        int v2 = query(a, b, rson);
        int v = 0;
        if (s[L].rmax < s[R].lmin){
            v = min(mid - a + 1, s[L].r) + min(b - mid, s[R].l);
        }
        return max(v, max(v1, v2));
    }
    else if (a <= mid)return query(a, b, lson);
    else return query(a, b, rson);
}
void update(int a, int k, int l, int r, int rt){
    if (l == r){
        s[rt].rmax = s[rt].lmin = k;
        return;
    }
    if (a <= mid)update(a, k, lson);
    if (a > mid)update(a, k, rson);
    pushup(rt);
}
int main(){
    cin >> t;
    while (t--){
        char str[2];
        cin >> n >> m;
        build(1, n, 1);
        while (m--){
            int a, b;
            cin >> str >> a >> b;
            if (str[0] == 'Q')cout << query(a+1, b+1, 1, n, 1) << endl;
            else update(a + 1, b, 1, n, 1);
        }
    }
}