Description
Input
Output
Sample Input
5 3 1 6 1 5 3 5 4 4 4 4
Sample Output
15
Data Constraint
k<=n.
Hint
\
Solutoin
设f[ i ][ j ]表示前i层选了j个矩形的最大面积。
则f[ i ][ j ]=max{ f[ k ][ j-1 ]+ ( r[ i ]-l[ i ]+1 )*(i-k) }
用斜率优化一下即可。
注意答案为f[ k ][ 1...k ]~f[ n ][ 1...k ]的最大值。
Code
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define I int
#define db double
#define ll long long
#define F(i,a,b) for(I i=a;i<=b;i++)
#define Fd(i,a,b) for(I i=a;i>=b;i--)
#define mem(a,b) memset(a,b,sizeof a)
#define N 20002
using namespace std;
ll n,m,l,r,s[N],f[N][102],ans;
I q[N],k;
void R(ll &x){
x=0;char c=getchar();
while(c<'0'||c>'9') c=getchar();
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
}
db slope(I x,I y){return 1.0*(db)(f[x][k-1]-f[y][k-1])/(x-y);}
I main(){
freopen("pyramid.in","r",stdin);
freopen("pyramid.out","w",stdout);
R(n),R(m);
F(i,1,n){
R(l),R(r);
s[i]=r-l+1;
}
F(j,1,m){
q[l=r=1]=0;k=j;
F(i,1,n){
while(l<r&&slope(q[l],q[l+1])>=s[i]) l++;
f[i][j]=f[q[l]][j-1]+s[i]*(i-q[l]);
while(l<r&&slope(i,q[r])>slope(q[r],q[r-1])) r--;
q[++r]=i;
if(i>=m) ans=max(ans,f[i][j]);
}
}
printf("%lld\n",ans);
return 0;
}