#3：调试疯了——3

UVA11992，自己板子真心难调bugwoc

#include <bits/stdc++.h>
#define maxn 50005
using namespace std;

struct Seg {
    int l, r;
    int sum, maxx, minn;
};

struct tree {
    Seg t[maxn<<2];
    int addv[maxn<<2], setv[maxn<<2];

    void init(int c) {
        for (int i = 1; i <= (c<<2); i++) {
            addv[i] = 0;
            setv[i] = -1;
        }
    }

    void push_up(int p) {
        int ls = p << 1, rs = p << 1 | 1;
        t[p].sum = t[ls].sum + t[rs].sum;
        t[p].maxx = max(t[ls].maxx, t[rs].maxx);
        t[p].minn = min(t[ls].minn, t[rs].minn);
    }

    void build(int l, int r, int p) {
        t[p].l = l, t[p].r = r;
        if (l == r) {
            t[p].sum = t[p].maxx = t[p].minn = 0;
            return;
        }

        int mid = (l + r) >> 1;
        int ls = p << 1, rs = p << 1 | 1;
        build(l, mid, ls);
        build(mid+1, r, rs);
        push_up(p);
    }

    void push_down(int p) {
        int ls = p << 1, rs = p << 1 | 1;
        if (setv[p] >= 0) {
            t[ls].sum = setv[p]*(t[ls].r-t[ls].l+1);
            t[rs].sum = setv[p]*(t[rs].r-t[rs].l+1);
            t[ls].maxx = t[rs].maxx = setv[p];
            t[ls].minn = t[rs].minn = setv[p];
            setv[ls] = setv[rs] = setv[p];
            addv[ls] = addv[rs] = 0;
            setv[p] = -1;
        }
        if (addv[p]) {
            t[ls].maxx += addv[p];
            t[rs].maxx += addv[p];
            t[ls].minn += addv[p];
            t[rs].minn += addv[p];
            t[ls].sum += addv[p]*(t[ls].r-t[ls].l+1);
            t[rs].sum += addv[p]*(t[rs].r-t[rs].l+1);
            addv[ls] += addv[p];
            addv[rs] += addv[p];
            addv[p] = 0;
        }
    }

    void update(int l, int r, int k, int p, int flag) {
        if (l <= t[p].l && t[p].r <= r) {
            if (flag) {
                t[p].maxx = t[p].minn = k;
                t[p].sum = k*(t[p].r - t[p].l + 1);
                setv[p] = k;
                addv[p] = 0;
            } else {
                t[p].maxx += k;
                t[p].minn += k;
                t[p].sum += k*(t[p].r - t[p].l + 1);
                addv[p] += k;
            }
            return;
        }

        int mid = (t[p].l + t[p].r) >> 1;
        int ls = p << 1, rs = p << 1 | 1;
        push_down(p);
        if (l <= mid)    update(l, r, k, ls, flag);
        if (mid < r)    update(l, r, k, rs, flag);
        push_up(p);
    }

    Seg query(int l, int r, int p) {
        if (l <= t[p].l && t[p].r <= r)    return t[p];

        int mid = (t[p].l + t[p].r) >> 1;
        int ls = p << 1, rs = p << 1 | 1;
        push_down(p);
        if (l > mid)    return query(l, r, rs);
        if (r <= mid)    return query(l, r, ls);

        Seg a, b, ans;
        a = query(l, r, ls);
        b = query(l, r, rs);
        ans.sum = a.sum + b.sum;
        ans.maxx = max(a.maxx, b.maxx);
        ans.minn = min(a.minn, b.minn);
        return ans;
    }
}T[21];

int r, c, m, v;

int main() {
    while (~scanf("%d%d%d", &r, &c, &m)) {
        for (int i = 1; i <= r; i++) {
            T[i].init(c);
            T[i].build(1, c, 1);
        }
        while (m--) {
            int o, x1, y1, x2, y2;
            scanf("%d%d%d%d%d", &o, &x1, &y1, &x2, &y2);

            if (o == 3) {
                int sum = 0, minn = 1e9+1, maxx = -1e9-1;
                for (int i = x1; i <= x2; i++) {
                    Seg a = T[i].query(y1, y2, 1);
                    sum += a.sum;
                    minn = min(minn, a.minn);
                    maxx = max(maxx, a.maxx);
                }
                printf("%d %d %d
", sum, minn, maxx);
            } else {
                scanf("%d", &v);
                for (int i = x1; i <= x2; i++)
                    T[i].update(y1, y2, v, 1, o-1);
            }
        }
    }
    return 0;
}

Contest hunter最长公共上升子序列。

#include <cstdio>
#define R(a) scanf("%d", &a);
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define max(a, b) a > b ? a : b

int n, ans;
int a[3001], b[3001], f[3001][3001];

int main() {
    R(n);
    rep(i, 1, n)    R(a[i]);
    rep(i, 1, n)    R(b[i]);
    rep(i, 1, n) {
        int val = 0;
        rep(j, 1, n) {
            if (a[i] == b[j]) {
                f[i][j] = val + 1;
            } else {
                f[i][j] = f[i-1][j];
                if (b[j] < a[i])    val = max(val, f[i][j]);
            }
        }
    }
    
    rep(i, 1, n)    ans = max(ans, f[n][i]);
    printf("%d
", ans);
    return 0;
}

POJ3666，数据比较水可以只写递增不写递减就AC……

可以滚动数组，也可nlogn优先队列奇妙过法，跟cf#371div1的C是同一道题，那个题的过法网友们也是千奇百怪，神奇的优先队列看了半天解释也没看懂，目前水平太低悟不透这些，先放坑里。

假A代码：

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define maxn 2001
#define init(a, b) memset(a, b, sizeof(a))
#define R(a) scanf("%d", &a)
#define REP(i, a, b) for (int i = a; i <= b; i++)

int n, a[maxn];
int num[maxn], f[maxn][maxn];

int main() {
    R(n);
    REP(i, 1, n) {
        R(a[i]);
        num[i] = a[i];
    }

    sort(num+1, num+1+n);
    int m = unique(num+1, num+1+n) - (num+1);

    init(f, 0x3f);
    f[0][0] = 0;

    REP(i, 1, n) {
        int temp = f[i-1][0];
        REP(j, 1, m) {
            temp = min(temp, f[i-1][j]);
            f[i][j] = temp + abs(a[i] - num[j]);
        }
    }

    int ans = 0x3f3f3f3f;
    REP(i, 1, m)    ans = min(ans, f[n][i]);
    printf("%d", ans);

    return 0;
}