把土地按照长严格递减,宽严格递增排序,如果有两块土地有包含关系,去掉较小的土地(这里因为没想清楚,又WA了一波,呵呵).
然后我们发现如果要把多块土地当作一组购买,这些土地在排序后的序列中一定是连续的一段,DP+斜率优化就不难想到了.
AC code:
#include <queue>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll N=50010;
const ll INF=(1<<28)*(1<<28);
ll n,m;
ll f[N];
struct Data{
ll a,b;
friend bool operator<(Data x,Data y){
if(x.a!=y.a) return x.a>y.a;
return x.b>y.b;
}
}d1[N],d2[N];
struct Vec{
ll x,y;
Vec() {}
Vec(ll x,ll y):x(x),y(y) {}
friend Vec operator-(Vec a,Vec b){
return Vec(a.x-b.x,a.y-b.y);
}
friend ll operator*(Vec a,Vec b){
return a.x*b.y-a.y*b.x;
}
};
deque<Vec> Q;
int main(){
scanf("%lld",&n);
for(ll i=1;i<=n;i++) scanf("%lld%lld",&d1[i].a,&d1[i].b);
sort(d1+1,d1+n+1);
for(ll i=1,mx;i<=n;i++){
if(i==1||d1[i].b>mx){
mx=d1[i].b;
d2[++m]=d1[i];
}
}
for(ll i=1;i<=m;i++){
ll A=d2[i].b,X=d2[i].a,Y=f[i-1];
Vec a,b,tmp=Vec(X,Y);
while(Q.size()>1){
a=Q.front();Q.pop_front();b=Q.front();
if((tmp-a)*(a-b)>0){
Q.push_front(a);
break;
}
}
Q.push_front(tmp);
while(1){
a=Q.back();
f[i]=A*a.x+a.y;
if(Q.size()==1) break;
Q.pop_back();b=Q.back();
if(A*b.x+b.y>f[i]){
Q.push_back(a);
break;
}
}
}
printf("%lld\n",f[m]);
return 0;
}