Poj 3468

TLE + WA 了无数次, 发现了不少毛病, 做个记录先

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
using namespace std;


#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

const int maxn = 100000 + 2;
long long n[maxn << 2], col[maxn << 2];
long long N, Q;

void pushUp(int rt)
{
    n[rt] = n[rt << 1] + n[rt << 1 | 1];
}

void build(int l, int r, int rt)
{
    if(l == r)
    {
        scanf("%lld", &n[rt]);
        return ;
    }
    
    int m = (l + r) >> 1;
    build(lson);
    build(rson);
    
    pushUp(rt);
}

void pushDown(int m, int rt)
{
    if(!col[rt]) return ;
    
    col[rt << 1] += col[rt];
    col[rt << 1 | 1] += col[rt];
    
    n[rt << 1] += (m - (m >> 1)) * col[rt];
    n[rt << 1 | 1] += (m >> 1) * col[rt];
    
    col[rt] = 0;
}

void upDate(int L, long long R, long long c, long long l, long long r, long long rt)
{
    if(!c) return;
    
    if(L <= l && R >= r)
    {
        col[rt] += c;
        n[rt] += c * (r - l + 1);
        return ;
    }
        
    long long m = (l + r) >> 1;
    pushDown(r - l + 1, rt);
    if(L <= m) upDate(L, R, c, lson);
    if(R > m) upDate(L, R, c, rson);    
    pushUp(rt);
}

long long Query(long long L, long long R, long long l, long long r, long long rt)
{
    if(L <= l && R >= r)
        return n[rt];
        
    long long m = (l + r) >> 1, ret = 0;
    pushDown(r - l + 1, rt);
    
    upDate(L, R, col[rt], lson);
    upDate(L, R, col[rt], rson);
    col[rt] = 0;
    
    if(L <= m) ret += Query(L, R, lson);
    if(R > m) ret += Query(L, R, rson);
    return ret;
}

int main()
{    
    //freopen("in", "r", stdin);
    
    while(~scanf("%lld%lld", &N, &Q))
    {
        memset(n, 0, sizeof(n));
        memset(col, 0, sizeof(col));
    
        build(1, N, 1);
        
        for(long long i = 1; i <= Q; i++)
        {
            char q[5];
            scanf("%s", q);
            if(!strcmp(q, "Q"))
            {
                long long l, r; 
                scanf("%lld%lld", &l, &r);
                printf("%lld
", Query(l, r, 1, N, 1));            
            } else if(!strcmp(q, "C")){
                long long l, r, c;
                scanf("%lld%lld%lld", &l, &r, &c);
                upDate(l, r, c, 1, N, 1);        
            }
        }
    }
}

Mind:

1.数据范围没注意, int -> long long , 以及应该注意不同的oj用的编译器不同对long long , __int64的调用也不一样

2.线段树的延迟标记的处理

3.此模板一定要留住, 留住!!!再也没有再改一次的勇气了...