splay练习,查找前驱后继即可。
/*************************************************************
Problem: bzoj 1588 [HNOI2002]营业额统计
User: fengyuan
Language: C++
Result: Accepted
Time: 176 ms
Memory: 1760 kb
Submit_Time: 2017-11-22 22:00:38
*************************************************************/
#include<cstdio>
#include<cstring>
#include<algorithm>
#define rep(i, x, y) for (int i = (x); i <= (y); i ++)
using namespace std;
const int N = 40010;
const int INF = 1e9;
int n, rt, sum, ans, p;
int data[N], sz[N], fa[N], ch[N][2], mark[N];
inline void pushup(int x)
{
sz[x] = sz[ch[x][0]] + sz[ch[x][1]] + 1;
}
inline void rot(int x)
{
int y = fa[x], z = fa[y];
bool f = ch[y][1] == x;
ch[y][f] = ch[x][f^1];
if (ch[x][f^1]) fa[ch[x][f^1]] = y;
fa[x] = z;
if (z) ch[z][ch[z][1] == y] = x;
fa[y] = x; ch[x][f^1] = y;
pushup(y); pushup(x);
}
inline void splay(int x, int top)
{
while (fa[x] != top){
int y = fa[x], z = fa[y];
if (z != top) rot((ch[z][0] == y) == (ch[y][0] == x) ? y : x);
rot(x);
}
if (top == 0) rt = x;
}
inline void insert(int v)
{
int x = rt;
if (rt == 0){
rt = x = ++ sum; p = sum;
data[x] = v; sz[x] = 1;
fa[x] = ch[x][0] = ch[x][1] = 0;
return;
}
while (x){
sz[x] ++;
if (v == data[x]){
mark[x] = 1; break;
}
int &y = ch[x][v > data[x]];
if (y == 0){
y = ++ sum;
data[y] = v; sz[y] = 1;
fa[y] = x; ch[y][0] = ch[y][1] = 0;
x = y;
break;
}
x = y;
}
p = x; splay(x, 0);
}
inline int getPre(int p)
{
if (mark[p]) return data[p];
int x = ch[p][0];
if (!x) return -INF;
while (ch[x][1]) x = ch[x][1];
return data[x];
}
inline int getNxt(int p)
{
if (mark[p]) return data[p];
int x = ch[p][1];
if (!x) return INF;
while (ch[x][0]) x = ch[x][0];
return data[x];
}
int main()
{
scanf("%d", &n);
rep(i, 1, n){
int x; scanf("%d", &x);
insert(x);
if (i == 1){
ans += x;
continue;
}
int pre = getPre(p), nxt = getNxt(p);
ans += min(x-pre, nxt-x);
}
printf("%d\n", ans);
return 0;
}