HDU 4031 Attack

树状数组。每个点都有护盾，每次攻击一片，被攻击的点就破盾，需要T秒充能，在充能期间被击中就会受伤，询问单点受伤次数。

用树状数组来维护每个点被击中的次数，并保存下来攻击的区间。询问时先求出该点被击中次数，再减去成功防御的次数，就是受伤的次数。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", n)
#define PC(n) printf("Case %d:\n", n)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 9901;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int N = 22222;
const int M = 22;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

struct atk
{
    int begin, end;
    atk(){};
    atk(int x, int y){begin = x, end = y;};
}a[N];
int c[N];

void add(int x, int p)
{
    while(x < N)
    {
        c[x] += p;
        x += x & (-x);
    }
}

int sum(int x)
{
    int s = 0;
    while(x > 0)
    {
        s += c[x];
        x -= x & (-x);
    }
    return s;
}

int main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int t, n, m, T, time, x, y, def, ans;
    char op[11];
    RI(t);
    FFF(cas, 1, t)
    {
        RIII(n, m, T);
        CLR(c, 0);
        time = 0;
        PC(cas);
        while(m--)
        {
            RS(op);
            if(op[0] == 'A')
            {
                RII(x, y);
                a[time++] = atk(x, y);
                add(x, 1);
                add(y + 1, -1);
            }
            else
            {
                def = 0;
                RI(x);
                ans = sum(x);
                REP(i, time)
                {
                    if(a[i].begin <= x && x <= a[i].end)
                    {
                        def++;
                        i += T - 1;
                    }
                }
                PI(ans - def);
            }
        }
    }
    return 0;
}