bzoj 1010: [HNOI2008]玩具装箱toy

斜率优化还是用浮点数的写法好写啊，以后就这么写了，还不会错（因为斜率相等的情况对于斜率优化是无所谓的，所以说浮点数误差不会导致错误）

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 50005;
int C[maxn],q[maxn];
LL sum[maxn],dp[maxn];
double calc( int x,int y ){
    double dy = ( y+sum[y] )*( y+sum[y] ) + dp[y] - ( x+sum[x] )*( x+sum[x] )-dp[x];
    double dx = y+sum[y]-x-sum[x];
    return dy /dx;
}
int main() {
    int n, L;
    scanf("%d%d", &n, &L);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &C[i]);
        sum[i] = sum[i - 1] + C[i];
    }
    int l = 0, r = 0;
    for (int i = 1; i <= n; i++) {
        while( l < r && 2*( i+sum[i]-1-L ) > calc( q[l+1],q[l] ) ) l++;
        int j = q[l];
        dp[i] = dp[j] + ( i+sum[i]-1-L )*( i+sum[i]-1-L ) + ( j+sum[j] )*(j+sum[j]) -2*( i+sum[i]-1-L )*( j+sum[j] );
        while(l < r && calc(q[r],i ) < calc( q[r-1],q[r] ) ) r--;
        q[++r] = i;
    }
    printf("%lld",dp[n]);
    return 0;
}