f[i]=min(fj]+(i−j−1)∗(i−j)/2+a[i])
对于k > j且k的决策优于j:
f[k]+(i−k−1)∗(i−k)+a[i]<f[j]+(i−j−1)∗(i−j)+a[i]
移项后:
i>f[k]+k²+k2−f[j]−j²+j2k−j
显然满足决策单调性,然后维护个下凸壳,斜率优化随便搞搞就好了
【代码】
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#define INF 1000000000001
#define mod 1000000007
#define N 1000005
using namespace std;
typedef long long ll;
int read()
{
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return x*f;
}
int n,l,r;
int a[N],q[N];
ll f[N];
double slope(int j,int k){
return (double)(f[k]+(((ll)k*k+k)>>1)-f[j]-(((ll)j*j+j)>>1))/(k-j);
}
int main()
{
n=read();
for(register int i=1;i<=n;i++) a[i]=read();
for(register int i=1;i<=n;i++)
{
while(l<r&&slope(q[l],q[l+1])<i) l++;
int t=q[l];f[i]=f[t]+(((ll)(i-t-1)*(i-t))>>1)+a[i];
while(l<r&&slope(q[r],i)<slope(q[r-1],q[r])) r--;
q[++r]=i;
}
printf("%lld\n",f[n]);
return 0;
}