题面描述
思路
这道题看一看,貌似就是
小的跟小的混,大的跟大的混嘛
简单来说就是从小到大排序。
状态转移方程
s s s为前缀和
F i = min ( F j − ( i − j ) ∗ a j + 1 + s i − s j ) F_i=\min(F_j-(i-j)*a_{j+1}+s_i-s_j) Fi=min(Fj−(i−j)∗aj+1+si−sj)
决策单调性
设
F j − ( i − j ) ∗ a j + 1 + s i − s j ≥ F k − ( i − k ) ∗ a k + 1 + s i − s k ( k > j ) F_j-(i-j)*a_{j+1}+s_i-s_j\ge F _k-(i-k)*a_{k+1}+s_i-s_k(k>j) Fj−(i−j)∗aj+1+si−sj≥Fk−(i−k)∗ak+1+si−sk(k>j)
在未来状态 t t t下,
证明:
F j − ( t − j ) ∗ a j + 1 − s t + s j ≥ F k − ( t − k ) ∗ a k + 1 + s t − s k F_j-(t-j)*a_{j+1}-s_t+s_j\ge F_k-(t-k)*a_{k+1}+s_t-s_k Fj−(t−j)∗aj+1−st+sj≥Fk−(t−k)∗ak+1+st−sk
F j − ( t − j ) ∗ a j + 1 − s j ≥ F k − ( t − k ) ∗ a k + 1 − s k F_j-(t-j)*a_{j+1}-s_j\ge F_k-(t-k)*a_{k+1}-s_k Fj−(t−j)∗aj+1−sj≥Fk−(t−k)∗ak+1−sk
t = i + v a l ( v a l > 0 ) t=i+val(val>0) t=i+val(val>0)
仅需证明:
− v a l ∗ a j + 1 ≥ − v a l ∗ a k + 1 -val*a_{j+1}\ge -val*a_{k+1} −val∗aj+1≥−val∗ak+1
a j + 1 ≤ a k + 1 a_{j+1}\le a_{k+1} aj+1≤ak+1
证毕。
踢队头
F j − ( i − j ) ∗ a j + 1 − s j ≥ F k − ( i − k ) ∗ a k + 1 − s k ( k > j ) F_j-(i-j)*a_{j+1}-s_j\ge F _k-(i-k)*a_{k+1}-s_k(k>j) Fj−(i−j)∗aj+1−sj≥Fk−(i−k)∗ak+1−sk(k>j)
F j − F k + j ∗ a j + 1 − k ∗ a k + 1 − s j + s k ≥ i ∗ a j + 1 − i ∗ a k + 1 F_j-F_k+j*a_{j+1}-k*a_{k+1}-s_j+s_k\ge i*a_{j+1}-i*a_{k+1} Fj−Fk+j∗aj+1−k∗ak+1−sj+sk≥i∗aj+1−i∗ak+1
c a l c ( j , k ) = F j − F k + j ∗ a j + 1 − k ∗ a k + 1 − s j + s k a j + 1 − a k + 1 ≤ i calc(j,k)=\frac{F_j-F_k+j*a_{j+1}-k*a_{k+1}-s_j+s_k}{a_{j+1}-a_{k+1}}\le i calc(j,k)=aj+1−ak+1Fj−Fk+j∗aj+1−k∗ak+1−sj+sk≤i
k k k优于 j j j
即
c a l c ( q h e a d , q h e a d + 1 ) ≤ i calc(q_{head},q_{head+1})\le i calc(qhead,qhead+1)≤i
q h e a d + 1 q_{head+1} qhead+1优于 q h e a d q_{head} qhead,踢去 h e a d head head
维护一个 c a l c ( q h e a d , q h e a d + 1 ) ≥ i calc(q_{head},q_{head+1})\ge i calc(qhead,qhead+1)≥i队列
同时我们可以发现, c a l c ( q h e a d , q h e a d + 1 ) calc(q_{head},q_{head+1}) calc(qhead,qhead+1)随 i i i的增大, h e a d head head不断增大,而不断增大。
因此,队列维护的应该是一个下凸壳。
踢队尾
由于维护一个下凸壳,
所以
c a l c ( q t a i l − 1 , q t a i l ) ≤ c a l c ( q t a i l , i − m ) calc(q_{tail-1},q_{tail})\le calc(q_{tail},i-m) calc(qtail−1,qtail)≤calc(qtail,i−m)
反之,
当
c a l c ( q t a i l − 1 , q t a i l ) ≥ c a l c ( q t a i l , i − m ) calc(q_{tail-1},q_{tail})\ge calc(q_{tail},i-m) calc(qtail−1,qtail)≥calc(qtail,i−m)
踢去队尾。
AC code
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#define gc getchar()
#define ll long long
using namespace std;
const int N=4e5+10;
inline void qr(ll &x)
{
x=0;char c=gc;int f=1;
while(c<'0'||c>'9'){if(c=='-')f=-1;c=gc;}
while(c>='0'&&c<='9'){x=x*10+(c^48);c=gc;}
x*=f;
}
void qw(ll x)
{
if(x<0)x=-x,putchar('-');
if(x/10)qw(x/10);
putchar(x%10+48);
}
ll f[N],s[N],a[N];int q[N],l,r,n,m;
inline ll calc(int j,int k)
{
return f[k]-f[j]-s[k]+s[j]+k*a[k+1]-j*a[j+1];
}
inline ll sum(int j,int k)
{
return a[k+1]-a[j+1];
}
bool check(int i,int j,int k)
{
return calc(j,i)*sum(k,j)<=calc(k,j)*sum(j,i);
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
f[0]=0;
for(int i=1;i<=n;i++)qr(a[i]);
sort(a+1,a+n+1);s[0]=0;
for(int i=1;i<=n;i++)s[i]=s[i-1]+a[i];
for(int i=min((m<<1)-1,n);i>=m;i--)f[i]=s[i]-a[1]*i;
l=1;r=1;q[1]=m;
for(int i=m<<1;i<=n;i++)
{
while(l<r&&calc(q[l],q[l+1])<i*sum(q[l],q[l+1]))++l;
f[i]=f[q[l]]+(s[i]-s[q[l]])-(i-q[l])*a[q[l]+1];
while(l<r&&check(i-m+1,q[r],q[r-1]))--r;
q[++r]=i-m+1;
}
qw(f[n]);puts("");
}
return 0;
}