1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252
| template<class Info, class Tag> struct LazySegmentTree { int n; std::vector<Info> info; std::vector<Tag> tag; LazySegmentTree() : n(0) {} LazySegmentTree(int n_, Info v_ = Info()) { init(n_, v_); } template<class T> LazySegmentTree(std::vector<T> init_) { init(init_); } void init(int n_, Info v_ = Info()) { init(std::vector(n_, v_)); } template<class T> void init(std::vector<T> init_) { n = init_.size(); info.assign(4 << std::__lg(n), Info()); tag.assign(4 << std::__lg(n), Tag()); std::function<void(int, int, int)> build = [&](int p, int l, int r) { if (r - l == 1) { info[p] = init_[l]; return; } int m = (l + r) / 2; build(2 * p, l, m); build(2 * p + 1, m, r); pull(p); }; build(1, 0, n); } void pull(int p) { info[p] = info[2 * p] + info[2 * p + 1]; } void apply(int p, const Tag &v) { info[p].apply(v); tag[p].apply(v); } void push(int p) { apply(2 * p, tag[p]); apply(2 * p + 1, tag[p]); tag[p] = Tag(); } void modify(int p, int l, int r, int x, const Info &v) { if (r - l == 1) { info[p] = v; return; } int m = (l + r) / 2; push(p); if (x < m) { modify(2 * p, l, m, x, v); } else { modify(2 * p + 1, m, r, x, v); } pull(p); } void modify(int p, const Info &v) { modify(1, 0, n, p, v); } Info rangeQuery(int p, int l, int r, int x, int y) { if (l >= y || r <= x) { return Info(); } if (l >= x && r <= y) { return info[p]; } int m = (l + r) / 2; push(p); return rangeQuery(2 * p, l, m, x, y) + rangeQuery(2 * p + 1, m, r, x, y); } Info rangeQuery(int l, int r) { return rangeQuery(1, 0, n, l, r); } void rangeApply(int p, int l, int r, int x, int y, const Tag &v) { if (l >= y || r <= x) { return; } if (l >= x && r <= y) { apply(p, v); return; } int m = (l + r) / 2; push(p); rangeApply(2 * p, l, m, x, y, v); rangeApply(2 * p + 1, m, r, x, y, v); pull(p); } void rangeApply(int l, int r, const Tag &v) { return rangeApply(1, 0, n, l, r, v); } void half(int p, int l, int r) { if (info[p].act == 0) { return; } if ((info[p].min + 1) / 2 == (info[p].max + 1) / 2) { apply(p, {-(info[p].min + 1) / 2}); return; } int m = (l + r) / 2; push(p); half(2 * p, l, m); half(2 * p + 1, m, r); pull(p); } void half() { half(1, 0, n); } template<class F> int findFirst(int p, int l, int r, int x, int y, F &&pred) { if (l >= y || r <= x) { return -1; } if (l >= x && r <= y && !pred(info[p])) { return -1; } if (r - l == 1) { return l; } int m = (l + r) / 2; push(p); int res = findFirst(2 * p, l, m, x, y, pred); if (res == -1) { res = findFirst(2 * p + 1, m, r, x, y, pred); } return res; } template<class F> int findFirst(int l, int r, F &&pred) { return findFirst(1, 0, n, l, r, pred); } template<class F> int findLast(int p, int l, int r, int x, int y, F &&pred) { if (l >= y || r <= x) { return -1; } if (l >= x && r <= y && !pred(info[p])) { return -1; } if (r - l == 1) { return l; } int m = (l + r) / 2; push(p); int res = findLast(2 * p + 1, m, r, x, y, pred); if (res == -1) { res = findLast(2 * p, l, m, x, y, pred); } return res; } template<class F> int findLast(int l, int r, F &&pred) { return findLast(1, 0, n, l, r, pred); } void maintainL(int p, int l, int r, int pre) { if (info[p].difl > 0 && info[p].maxlowl < pre) { return; } if (r - l == 1) { info[p].max = info[p].maxlowl; info[p].maxl = info[p].maxr = l; info[p].maxlowl = info[p].maxlowr = -inf; return; } int m = (l + r) / 2; push(p); maintainL(2 * p, l, m, pre); pre = std::max(pre, info[2 * p].max); maintainL(2 * p + 1, m, r, pre); pull(p); } void maintainL() { maintainL(1, 0, n, -1); } void maintainR(int p, int l, int r, int suf) { if (info[p].difr > 0 && info[p].maxlowr < suf) { return; } if (r - l == 1) { info[p].max = info[p].maxlowl; info[p].maxl = info[p].maxr = l; info[p].maxlowl = info[p].maxlowr = -inf; return; } int m = (l + r) / 2; push(p); maintainR(2 * p + 1, m, r, suf); suf = std::max(suf, info[2 * p + 1].max); maintainR(2 * p, l, m, suf); pull(p); } void maintainR() { maintainR(1, 0, n, -1); } };
struct Tag { int x = 0; void apply(const Tag &t) & { x += t.x; } };
struct Info { int x = -inf; void apply(const Tag &t) & { x += t.x; } };
Info operator+(const Info &a, const Info &b) { return {std::max(a.x, b.x)}; }
void solve() { int n = read();
vector<int> v(n); for (auto &x : v) x = read();
vector<int> a(n), rka(n); for (int i = 0; i < n; i++) { int x = read() - 1; a[i] = x, rka[x] = i; }
vector<int> b(n), rkb(n); for (int i = 0; i < n; i++) { int x = read() - 1; b[i] = x, rkb[x] = i; }
LazySegmentTree<Info, Tag> seg(n + 1); seg.modify(0, {0});
for (int i = 0; i < n; i++) { int x = rkb[a[i]];
auto t = seg.rangeQuery(0, x + 1); seg.modify(x + 1, t);
seg.rangeApply(0, x + 1, {v[a[i]]}); }
auto [ans] = seg.rangeQuery(0, n + 1); cout << ans << '\n'; }
|