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
| #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax (T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline int Chkmin (T &a, T b) { return a > b ? a = b, 1 : 0; }
inline int read ()
{
int sum = 0, fl = 1; char ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') fl = -1;
for (; isdigit(ch); ch = getchar()) sum = (sum << 3) + (sum << 1) + ch - '0';
return sum * fl;
}
const int Maxn = 500000 + 100;
int N, K, L, R, Root[Maxn];
LL Sum[Maxn], A[Maxn];
namespace SEG
{
int node_cnt = 0;
struct tree
{
int ls, rs, sum;
}Tree[Maxn * 40];
inline void build (int &now, int l, int r)
{
now = ++node_cnt;
if (l == r) return ;
int mid = l + r >> 1;
build (Tree[now].ls, l, mid), build (Tree[now].rs, mid + 1, r);
}
inline void insert (int &now, int pre, int l, int r, int x)
{
now = ++node_cnt;
Tree[now].ls = Tree[pre].ls, Tree[now].rs = Tree[pre].rs;
Tree[now].sum = Tree[pre].sum + 1;
if (l == r) return ;
int mid = l + r >> 1;
if (x <= mid) insert (Tree[now].ls, Tree[pre].ls, l, mid, x);
else insert (Tree[now].rs, Tree[pre].rs, mid + 1, r, x);
}
inline int query (int now, int pre, int l, int r, int k)
{
if (l == r)
{
if (Tree[now].sum - Tree[pre].sum) return A[l];
return 0;
}
int sum = Tree[Tree[now].ls].sum - Tree[Tree[pre].ls].sum, mid = l + r >> 1;
if (k <= sum) return query (Tree[now].ls, Tree[pre].ls, l, mid, k);
return query (Tree[now].rs, Tree[pre].rs, mid + 1, r, k - sum);
}
inline int query (int x, int y, int k)
{
return query (Root[y], Root[max(0, x - 1)], 1, Maxn, k);
}
}
struct node
{
LL val;
int l, r, k, y;
bool operator < (const node &x) const { return x.val > val; }
};
priority_queue <node> Q;
int main()
{
#ifdef hk_cnyali
freopen("A.in", "r", stdin);
freopen("A.out", "w", stdout);
#endif
N = read(), K = read(), L = read(), R = read();
++N;
for (int i = 2; i <= N; ++i)
A[i] = Sum[i] = Sum[i - 1] + read();
sort(A + 1, A + N + 1);
int len = unique(A + 1, A + N + 1) - A - 1;
SEG :: build (Root[0], 1, Maxn);
for (int i = 1; i <= N; ++i)
{
int pos = lower_bound (A + 1, A + len + 1, Sum[i]) - A;
SEG :: insert (Root[i], Root[i - 1], 1, Maxn, pos);
}
for (int i = L + 1; i <= N; ++i)
{
int l = max(0, i - R), r = max(0, i - L);
Q.push((node){Sum[i] - SEG :: query (l, r, 1), l, r, 1, i});
}
LL ans = 0;
while (K-- && !Q.empty())
{
node x = Q.top(); Q.pop();
ans += x.val;
int len_now = x.r - x.l + 1;
if (!x.l) len_now--;
if (x.k == len_now) continue;
Q.push((node){Sum[x.y] - SEG :: query (x.l, x.r, x.k + 1), x.l, x.r, x.k + 1, x.y});
}
cout<<ans<<endl;
return 0;
}
|