【线段树单点更新优化】H - Can you answer these queries? HDU - 4027

Think:
1知识点：线段树单点更新优化(优化条件(开根后平方数为1的结点不需要再次开根))
2题意：两种操作：对一个区间所有数取其平方数；对一个区间所有数求和
3反思：
1>注意数据范围
2>注意输入区间是否合法，是否L一定会小于R

vjudge题目链接

以下为Time Limit Exceeded代码——未加优化条件

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

#define MID int mid = (l+r)/2
#define lson rt<<1
#define rson rt<<1|1

typedef long long LL;

const int N = 101400;

struct Tree{
    LL sum;
}tree[N<<2];

void Build(int l, int r, int rt);
void up_data(int rt);
void up_v(int L, int R, int l, int r, int rt);
LL Query(int L, int R, int l, int r, int rt);

LL data[N];

int main(){
    int k = 1, n, i, Q, q, L, R;
    while(~scanf("%d", &n)){
        printf("Case #%d:\n", k++);
        for(i = 1; i <= n; i++)
            scanf("%lld", &data[i]);
        Build(1, n, 1);
        scanf("%d", &Q);
        for(i = 0; i < Q; i++){
            scanf("%d %d %d", &q, &L, &R);
            if(L > R)
                swap(L, R);
            if(q == 0)
                up_v(L, R, 1, n, 1);
            else if(q == 1)