noi05 sequence 第二版

省选已经过了，感谢老向、谢老师以及mt的帮助，让我卡线进了。一试本来只有130的，后面mt改了数据，让我多过了两个点（骗一条链的情况），再加上二试一题降了40分，总体来说卡线过。早知道小点暴搜，大点贪心了。。。真伤心。。。

 

闲来无聊，又写了一遍sequence。把代码缩短了。

 

#include <stdio.h> #include <memory.h> #include <stdlib.h> #define maxnode 500000 #define oo 0x3F3F3F3F #define MINIT() (fgets(cmd, sizeof(cmd), fin), p = strtok(cmd, " ")) #define MGET(i) (p = strtok(0, " "), i = atoi(p)) int spson[2][maxnode + 5], *left = spson[0], *right = spson[1]; int root, *pson[2]; int same[maxnode + 3]; int sum[maxnode + 3]; int key[maxnode + 3]; int mss[maxnode + 3]; int lms[maxnode + 3]; int rms[maxnode + 3]; int size[maxnode + 3]; int freenode[maxnode + 3], fntop; char cmd[maxnode * 6], *p; char rev[maxnode + 3]; inline int max (int i, int j) { return i > j ? i : j; } inline int collect (int t) { lms[t] = max (lms[left[t]], sum[left[t]] + key[t] + max (lms[right[t]], 0)); rms[t] = max (rms[right[t]], sum[right[t]] + key[t] + max (rms[left[t]], 0)); mss[t] = max (max (mss[left[t]], mss[right[t]]), max (rms[left[t]], 0) + key[t] + max (lms[right[t]], 0)); sum[t] = sum[left[t]] + sum[right[t]] + key[t]; size[t] = size[left[t]] + size[right[t]] + 1; return t; } inline void download (int t) { if (!t) return; int k; if (same[t] != oo) { key[t] = same[t]; same[left[t]] = same[right[t]] = same[t]; same[t] = oo, rev[t] = 0, sum[t] = size[t] * key[t]; mss[t] = lms[t] = rms[t] = max (key[t], sum[t]); } else if (rev[t]) { rev[t] = 0; k = left[t], left[t] = right[t], right[t] = k; k = rms[t], rms[t] = lms[t], lms[t] = k; rev[left[t]] = !rev[left[t]]; rev[right[t]] = !rev[right[t]]; } } void zig (int *l) { int t = l[root]; l[root] = l[0]; l[0] = root; root = t; } void zigzig (int *l, int *r) { int t = l[l[root]]; l[l[root]] = l[0]; l[0] = l[root]; l[root] = r[l[0]]; r[l[0]] = collect (root); root = t; } void finish (int *l, int *r) { int t = l[0], p = r[root]; for (; t; ) { t = l[l[0]]; l[l[0]] = p; p = collect (l[0]); l[0] = t; } r[root] = p; } void select (int k) { int t, p; for (; ; ) { download (root), download (left[root]), download (right[root]); int i = k > (t = size[left[root]]); if (k == t || !(p = pson[i][root])) break; if (i) k -= t + 1; download (left[p]), download (right[p]); int j = k > (t = size[left[p]]); if (k == t || !pson[j][p]) {zig (pson[i]); break;} if (j) k -= t + 1; i != j ? zig (pson[i]), zig (pson[j]) : zigzig (pson[i], pson[!i]); } finish (left, right), finish (right, left), collect (root); } void prepare (int pos, int total) { select (pos - 1); int bak = root; root = right[root]; select (total); right[bak] = root, root = bak; } int build (int l, int r) { int mid = (l + r) >> 1, lc = 0, rc = 0, t; if (mid != l) lc = build (l, mid - 1); t = freenode[fntop++], MGET (key[t]); if (left[t]) freenode[--fntop] = left[t]; if (right[t]) freenode[--fntop] = right[t]; rev[t] = left[t] = right[t] = 0, same[t] = oo; sum[t] = lms[t] = rms[t] = mss[t] = key[t]; if (mid != r) rc = build (mid + 1, r); left[t] = lc, right[t] = rc; return collect (t); } int main() { FILE *fin = fopen ("sequence.in" , "r"); FILE *fout = fopen ("sequence.out", "w"); pson[0] = left, pson[1] = right, root = 1; key[0] = mss[0] = lms[0] = rms[0] = -oo, same[0] = oo; key[1] = -oo, left[1] = 0, right[1] = 2, size[1] = 2, same[1] = oo; key[2] = -oo, left[2] = 0, right[2] = 0, size[2] = 1, same[2] = oo; int n, m, i, pos, total, c, t; MINIT(), n = atoi(p), MGET(m), fgets(cmd + 3, sizeof(cmd), fin); cmd[0] = cmd[2] = ' ', cmd[1] = '1', p = strtok(cmd, " "); for (i = fntop = 3; i <= maxnode; ++i) freenode[i] = i; left[2] = build (1, n), collect (2), collect (1); for (; m; --m) { MINIT (); if (cmd[2] == 'X') { fprintf (fout, "%d/n", mss[root]); continue; } MGET (pos); MGET (total); if (cmd[2] == 'S') { prepare(pos + 1, 0); left[right[root]] = build(1, total); collect(right[root]), collect(root); continue; } prepare (pos, total), t = left[right[root]]; if (cmd[2] == 'L') freenode[--fntop] = t, left[right[root]] = 0; else if (cmd[2] == 'K') MGET (c), same[t] = c, download (t); else if (cmd[2] == 'V') rev[t] = !rev[t], download (t); if (cmd[2] == 'T') fprintf (fout, "%d/n", sum[t]); else collect (right[root]), collect (root); } fclose (fin); fclose (fout); return 0; }