[BZOJ1112][POI2008]砖块Klo

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;

int read() {
	int x = 0, f = 1; char c = getchar();
	while(!isdigit(c)){ if(c == ‘-‘) f = -1; c = getchar(); }
	while(isdigit(c)){ x = x * 10 + c - ‘0‘; c = getchar(); }
	return x * f;
}

#define maxn 100010
#define oo (1ll << 60)
#define LL long long
struct Node {
	int v, r, siz;
	LL sum;
	Node() {}
	Node(int _, int __): v(_), r(__) {}
} ns[maxn];
int ToT, rt, fa[maxn], ch[2][maxn];
void maintain(int o) {
	ns[o].siz = 1; ns[o].sum = ns[o].v;
	for(int i = 0; i < 2; i++) if(ch[i][o])
		ns[o].siz += ns[ch[i][o]].siz, ns[o].sum += ns[ch[i][o]].sum;
	return ;
}
void rotate(int u) {
	int y = fa[u], z = fa[y], l = 0, r = 1;
	if(z) ch[ch[1][z]==y][z] = u;
	if(ch[1][y] == u) swap(l, r);
	fa[u] = z; fa[y] = u; fa[ch[r][u]] = y;
	ch[l][y] = ch[r][u]; ch[r][u] = y;
	maintain(y); maintain(u);
	return ;
}
void insert(int& o, int v) {
	if(!o) {
		ns[o = ++ToT] = Node(v, rand());
		return maintain(o);
	}
	bool d = v > ns[o].v;
	insert(ch[d][o], v); fa[ch[d][o]] = o;
	if(ns[ch[d][o]].r > ns[o].r) {
		int t = ch[d][o];
		rotate(t); o = t;
	}
	return maintain(o);
}
void del(int& o, int v) {
	if(!o) return ;
	if(ns[o].v == v) {
		if(!ch[0][o] && !ch[1][o]) o = 0;
		else if(!ch[0][o]) {
			int t = ch[1][o]; fa[t] = fa[o]; o = t;
		}
		else if(!ch[1][o]) {
			int t  =ch[0][o]; fa[t] = fa[o]; o = t;
		}
		else {
			bool d = ns[ch[1][o]].r > ns[ch[0][o]].r;
			int t = ch[d][o]; rotate(t); o = t;
			del(ch[d^1][o], v);
		}
	}
	else {
		bool d = v > ns[o].v;
		del(ch[d][o], v);
	}
	return maintain(o);
}
int qkth(int o, int k) {
	if(!o) return -1;
	int ls = ch[0][o] ? ns[ch[0][o]].siz : 0;
	if(k == ls + 1) return ns[o].v;
	if(k > ls + 1) return qkth(ch[1][o], k - ls - 1);
	return qkth(ch[0][o], k);
}
LL lar(int o, int v) {
	if(!o) return 0;
	LL s = ch[1][o] ? ns[ch[1][o]].sum : 0;
	int ss = ch[1][o] ? ns[ch[1][o]].siz : 0;
	if(v < ns[o].v) return s + ns[o].v - (LL)(ss + 1) * v + lar(ch[0][o], v);
	return lar(ch[1][o], v);
}
LL sma(int o, int v) {
	if(!o) return 0;
	LL s = ch[0][o] ? ns[ch[0][o]].sum : 0;
	int ss = ch[0][o] ? ns[ch[0][o]].siz : 0;
	if(v > ns[o].v) return (LL)(ss + 1) * v - s - ns[o].v + sma(ch[1][o], v);
	return sma(ch[0][o], v);
}

int A[maxn];
int main() {
	int n = read(), k = read();
	for(int i = 1; i <= n; i++) A[i] = read();
	
	LL ans = oo;
	for(int i = 1; i <= k; i++) insert(rt, A[i]);
	int v = qkth(rt, (k >> 1) + 1);
//	printf("v: %d %lld\n", v, lar(rt, v) + sma(rt, v));
	ans = min(ans, lar(rt, v) + sma(rt, v));
	for(int i = k + 1; i <= n; i++) {
		insert(rt, A[i]); del(rt, A[i-k]);
		v = qkth(rt, (k >> 1) + 1);
//		printf("v: %d %lld\n", v, lar(rt, v) + sma(rt, v));
		ans = min(ans, lar(rt, v) + sma(rt, v));
	}
	
	printf("%lld\n", ans);
	
	return 0;
}