土地征用（斜率优化）

题目描述

Farmer John is considering buying more land for the farm and has his eye on $N (1 \leq N \leq 50,000)$ additional rectangular plots, each with integer dimensions ($1 \leq width_i \leq 1,000,000$; $1 <= length_i \leq 1,000,000$).

If FJ wants to buy a single piece of land, the cost is 1/square unit, but savings are available for large purchases. He can buy any number of plots of land for a price in dollars that is the width of the widest plot times the length of the longest plot. Of course, land plots cannot be rotated, i.e., if Farmer John buys a$3x5$ plot and a $5x3$ plot in a group, he will pay $5x5=25$.

FJ wants to grow his farm as much as possible and desires all the plots of land. Being both clever and frugal, it dawns on him that he can purchase the land in successive groups, cleverly minimizing the total cost by grouping various plots that have advantageous width or length values.

Given the number of plots for sale and the dimensions of each, determine the minimum amount for which Farmer John can purchase all

约翰准备扩大他的农场，眼前他正在考虑购买N块长方形的土地。如果约翰单买一块土 地，价格就是土地的面积。但他可以选择并购一组土地，并购的价格为这些土地中最大的长 乘以最大的宽。比如约翰并购一块$3 × 5$和一块$5 × 3$的土地，他只需要支付$5 × 5 = 25$元， 比单买合算。 约翰希望买下所有的土地。他发现，将这些土地分成不同的小组来并购可以节省经费。 给定每份土地的尺寸，请你帮助他计算购买所有土地所需的最小费用。

输入输出格式

输入格式：

• Line 1: $A$ single integer: $N$

• Lines 2..$N+1$: $Line$ $i+1$ describes plot i with two space-separated integers: $width_i$ and $length_i$

输出格式：

• Line 1: The minimum amount necessary to buy all the plots.

输入输出样例

输入样例#1：

4 
100 1 
15 15 
20 5 
1 100 

输出样例#1：

500 

说明

There are four plots for sale with dimensions as shown.

The first group contains a $100x1$ plot and costs $100$. The next group contains a $1x100$ plot and costs 100. The last group contains both the $20x5$ plot and the $15x15$ plot and costs$300$. The total cost is 500, which is minimal.

题解

这是一道斜率优化的版题，这里写一下做这种题的一般姿势。
首先推出dp转移方程，一般是$f_i=max${$f_j+a_i*b_j$},$j \in S$，
然后假设$k>j$且 $k,j \in S$,列出$f_j+a_i*b_j<f_k+a_i*b_k$，
接着可以得出$\frac{f_j-f_k}{b_k-b_j}<a_i$，就可以用单调队列维护了。

Code

#include<bits/stdc++.h>
using namespace std;

int n,tot=0,que[50010],l=1,r=0;
long long f[50010];
struct matrix{
    long long a,b;
    bool operator < (const matrix &t)const{
        if(b!=t.b)return b<t.b;
        return a<t.a;
    }
}mm[50010],m[50010];

double cal(int j,int k){        //j<k
    if(m[j+1].a==m[k+1].a)return f[k]>f[j]?-1926081777:1926081777;
    return (double)(f[k]-f[j])/(double)(m[j+1].a-m[k+1].a);
}

int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%lld%lld",&mm[i].a,&mm[i].b);
    sort(mm+1,mm+n+1);
    for(int i=1;i<=n;i++){
        while(tot&&m[tot].a<=mm[i].a)tot--;
        m[++tot]=mm[i];
    }
    f[0]=0;que[++r]=0;;
    for(int i=1;i<=tot;i++){
        while(l<r&&cal(que[l],que[l+1])<=(double)m[i].b)l++;
        f[i]=f[que[l]]+m[i].b*m[que[l]+1].a;
        while(l<r&&cal(que[r],i)<cal(que[r-1],que[r]))r--;
        que[++r]=i;
    }
    printf("%lld",f[tot]);
    return 0;
}