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

#include <iostream>
#include <cstdio>
using namespace std;
const int INF = 1<<30;
const int maxn = 1000005;
int getint() {
	int r = 0, k = 1; char c = getchar();
	for (; '0' > c || c > '9'; c = getchar()) if (c == '-') k = -1;
	for (; '0' <= c && c <= '9'; c = getchar()) r = r * 10 - '0' + c;
	return r * k;
}
typedef long long LL;
int n, m, f[maxn], w[maxn], next[maxn], h[maxn];
LL tag[maxn*5], mx[maxn*5], ans = 0;
void pu(int now) { mx[now] = max(mx[now<<1], mx[now<<1|1]); }
void pd(int now) {
	mx[now<<1] += tag[now];
	mx[now<<1|1] += tag[now];
	tag[now<<1] += tag[now];
	tag[now<<1|1] += tag[now];
	tag[now] = 0;
}
void change(int now, int l, int r, int ll, int rr, int x) {
	if (ll <= l && r <= rr) {
		if (l != r) tag[now] += x;
		mx[now] += x;
		return;
	}
	if (tag[now]) pd(now);
	int mid = (l+r)>>1;
	if (ll <= mid) change(now<<1, l, mid, ll, rr, x);
	if (rr > mid) change(now<<1|1, mid+1, r, ll, rr, x);
	pu(now);
}
int main() {
	n = getint(); m = getint();
	for (int i = 1; i <= n; ++i) f[i] = getint();
	for (int i = 1; i <= m; ++i) w[i] = getint();
	for (int i = n; i >= 1; --i) {
		next[i] = h[f[i]];
		h[f[i]] = i;
	}
	for (int i = 1; i <= m; ++i)
		if (h[i]) {
			if (next[h[i]]) change(1, 1, n, h[i], next[h[i]]-1, w[i]);
			else change(1, 1, n, h[i], n, w[i]);
		}
	int tmp;
	for (int i = 1; i <= n; ++i) {
		ans = max(ans, mx[1]);
		tmp = next[i];
		if (tmp) {
			change(1, 1, n, i, tmp-1, -w[f[i]]);
			if (next[tmp]) change(1, 1, n, tmp, next[tmp]-1, w[f[i]]);
			else change(1, 1, n, tmp, n, w[f[i]]);
		}
		else change(1, 1, n, i, n, -w[f[i]]);
	}
	printf("%lld", ans);
	return 0;
}