[BZOJ3156] 防御准备

设$f[i]$表示第$i$个检查站的位置建防御塔的最小花费

那么

$$f[i] = Min(f[j]+\sum_{k=j+1}^{i-1}(i-k))$$

考虑用斜率优化

设$j<k$且$k$比$j$更优，
那么可以得到

$$f[k]+\frac{(i-k)*(i-k-1)}{2} \le f[j]+\frac{(i-j)*(i-j-1)}{2}$$

化简得

$$\frac{2*(f[k]-f[j])+k^2-j^2+k-j}{2*(k-j)} \le i$$

设$slope(k,j)=\frac{2*(f[k]-f[j])+k^2-j^2+k-j}{2*(k-j)}$

于是可以得到，弹队首的条件:满足$slope(l,l+1)<=i$
弹队尾的条件:满足$slope(r,r-1)>slope(i,r)$
时间复杂度$O(N)$

#include <cstdio>

using namespace std;

template <class T>T Max (const T &a, const T &b) {return a > b ? a : b;}
template <class T>T Min (const T &a, const T &b) {return a < b ? a : b;}

typedef long long LL;
typedef double dl;

const int SN = 1000000 + 100;

LL a[SN], n, f[SN];
int que[SN], head, tail;

void Read(LL &x) {
    LL in = 0, f = 1;char  ch = getchar();
    while(ch<'0' || ch>'9') {if(ch=='-') f = -1;ch = getchar();}
    while(ch>='0' && ch<='9') {in = in*10+ch-'0'; ch = getchar();}
    x = in*f;
}

LL get_up(LL i,LL j) { //i,j都要开long long 
    return 2*(f[i]-f[j])+i*i-j*j+i-j;
}

dl get_slope(LL i,LL j) {
    return (double)((get_up(i,j))/(double)(i-j));
}

int main() {
    Read(n);

    for(int i = 1; i <= n; i++) Read(a[i]);

    for(int i = 1; i <= n; i++) {
        while(head < tail && get_slope(que[head+1],que[head])<= 2*i) head++;
        f[i] = f[que[head]] + (i-que[head])*(i-que[head]-1)/2 + a[i];
           while(head < tail && get_slope(i, que[tail]) <= get_slope(que[tail], que[tail-1]))
           tail--;
           que[++tail] = i;
    }

    printf("%lld\n",f[n]);
    return 0;
}