题解:先把宽按从大到小排序如果宽相同就按高度从大到小排序,接着把宽度和高度都小于某个点的删除掉,然后就可以求出方程就是dp[i][j] = min{dp[i-1][a]+x[a+1]*y[j]};
然后斜率优化的的话用队列维护可以化为dp[j]+x[j+1]*y[i]<dp[k]+x[k+1]*y[i],k<j当满足这个条件时候就可以把队头删除掉,加入队列的话满足(dp[b]-dp[c])*(x[c+1]-x[i+1])>=(dp[i]-dp[c])*(x[c+1]-x[b+1]),i>b>c就可以把队尾的的b删除掉
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<queue>
typedef long long int ll;
using namespace std;
#define ls rt*2
#define rs rt*2+1
#define mid (L+R)/2
#define lson ls,L,mid
#define rson rs,mid+1,R
#define x first
#define y second
typedef pair<int,int> pii;
const int mx = 5e4+5;
deque<int>q;
ll dp[105][mx];
int n,k;
struct node{
int x,y;
bool operator<(const node a)const{
if(x!=a.x) return x>a.x;
return y>a.y;
}
}a[mx];
int cnt;
void er