[LOJ6515] 「雅礼集训 2018 Day10」贪玩蓝月（线段树分治）

题意

• 维护一个双端队列，支持两端插入物品和删除物品，询问队列中体积取模在$[l,r]$中的物品选择方案中的最大价值。（$m\le 5\times 10^4，\text{mod}\le 500）$

动态增删不好做那就线段树分治离线下来，读入询问的时候把每个物品出现时间和结束时间都插入线段树中，对于背包只要维护好当前有多少个物品即可，插入的话直接暴力在之前的状态上DP一遍就好了，而删除的话因为是有顺序的，直接把指针前移即可，复杂度$O(\text{mod}\times \text{m log m})$。

#include <bits/stdc++.h>

#define x first
#define y second
#define pb push_back
#define mp make_pair
#define inf (0x3f3f3f3f)
#define INF (1e18)
#define mem(a, b) memset(a, b, sizeof(a))
#define Rep(i, a) for (int i = 0; i < a; ++ i)
#define For(i, a, b) for (int i = a; i <= b; ++ i)
#define Forr(i, a, b) for (int i = a; i >= b; -- i)
#define Travel(i, x) for (int i = head[x]; i; i = nxt[i])

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

template<class T>inline T read(T &_) {
	T __ = getchar(), ___ = 1; _ = 0;
	for (; !isdigit(__); __ = getchar()) if (__ == '-') ___ = -1;
	for (; isdigit(__); __ = getchar()) _ = (_ << 3) + (_ << 1) + (__ ^ 48);
	return _ *= ___;
}

template<class T>inline bool chkmax(T &_, T __) { return _ < __ ? _ = __, 1 : 0; }
template<class T>inline bool chkmin(T &_, T __) { return _ > __ ? _ = __, 1 : 0; }

inline void proStatus() {
	ifstream t("/proc/self/status");
	cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>());
}

const int N = 5e4 + 7;

char s[N];

int m, mod, L[N], R[N], ans[N];

struct node { int tim, w, v; } Q;

deque<node> q;

struct Backpack {

	int cnt; ll f[N][500];

	Backpack() { Rep(i, N) Rep(j, 500) f[i][j] = -INF; f[0][0] = 0; }

	void insert(PII now) {
		int x = now.x % mod, y = now.y;
		++ cnt;
		Rep(i, mod) f[cnt][i] = f[cnt - 1][i];
		if (y == 5) cerr << ' ' << cnt << ' ' << x << endl;
		Rep(i, mod) {
			if (x <= i) chkmax(f[cnt][i], f[cnt - 1][i - x] + y);
			else chkmax(f[cnt][i], f[cnt - 1][i + mod - x] + y);
			//cout << i << ' ' << f[cnt][i] << endl;
		}
		//puts("");
	}

	void recall() {
		Rep(i, 500) f[cnt][i] = -INF;
		-- cnt;
	}

	ll query(int l, int r) {
		ll res = -1;
		For(j, l, r) chkmax(res, f[cnt][j]);
		return res; 
	}

} Bag;

struct Segment_Tree {

#define ls (bh << 1)
#define rs (ls | 1)
#define mid ((l + r) >> 1)
#define lson ls, l, mid
#define rson rs, mid + 1, r

	vector<PII> S[N << 2];

	void insert(int bh, int l, int r, int x, int y, PII z) {
		if (x <= l && r <= y) S[bh].pb(z);
		else {
			if (x <= mid) insert(lson, x, y, z);
			if (y > mid) insert(rson, x, y, z);
		}
	}

	void Solve(int bh, int l, int r) {
		int sz = S[bh].size();
		Rep(i, sz) Bag.insert(S[bh][i]);
		if (l ^ r) Solve(lson), Solve(rson);
		else if (L[l] ^ -1) ans[l] = Bag.query(L[l], R[r]);
		Rep(i, sz) Bag.recall();
	}

} T; 


int main() {

	freopen("6515.in", "r", stdin);
	freopen("6515.out", "w", stdout);

	int x, y;

	mem(L, -1), read(m), read(mod);
	For(i, 1, m) {
		scanf("%s", s);
		if (s[0] == 'D') {
			if (s[1] == 'F') Q = q.front(), q.pop_front();
			else Q = q.back(), q.pop_back();
			T.insert(1, 1, m, Q.tim, i - 1, mp(Q.w, Q.v));
		} else {
			read(x), read(y);
			if (s[1] == 'U') L[i] = x, R[i] = y;
			else {
				Q = (node) { i, x, y };
				if (s[1] == 'F') q.push_front(Q);
				else q.push_back(Q);
			}
		}
	}
	for (; !q.empty(); q.pop_front()) 
		Q = q.front(), T.insert(1, 1, m, Q.tim, m, mp(Q.w, Q.v));

	T.Solve(1, 1, m);
	For(i, 1, m) if (L[i] ^ -1) printf("%d\n", ans[i]);

	return 0;
}