[JZOJ5390]【NOIP2017提高A组模拟9.26】逗气

Descrption

Solution

可以先把所有的n+m个点按照位置排个序，然后正反分别做一次，就可以把绝对值去掉了。

那么还是可以推出一个斜率式子的，因为斜率di是会变得，那么维护一个凸包（也就是一个只从后面进的，队头不出的单调队列），每次对于一个di二分顶点查找最优值就行了。

#

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define N 200005
#define LL long long
using namespace std;
LL n,m,a[N][2],b[N][2],ans[N],d[N],l,r;
struct node
{
    LL w,s,p;
}a1[N*2];
bool cmp(node x,node y)
{
    return x.w<y.w;
}
LL get(int x,int y)
{
    return a1[x].s-a1[y].s;
}
LL get2(int x,int y)
{
    return a1[x].w-a1[y].w;
}
int main()
{
    freopen("gas.in","r",stdin);
    freopen("gas.out","w",stdout);
    cin>>n>>m;
    fo(i,1,n) scanf("%lld%lld",&a[i][0],&a[i][1]);
    fo(i,1,m) scanf("%lld%lld",&b[i][0],&b[i][1]);
    LL w1=0;
    fo(i,1,n) a1[i].w=a[i][0],a1[i].s=a[i][1],a1[i].p=0;
    fo(i,1,m) a1[i+n].w=b[i][0],a1[i+n].s=b[i][1],a1[i+n].p=i;
    sort(a1+1,a1+n+m+1,cmp);
    l=1,r=0;
    fo(i,1,n+m)
    {
        if(a1[i].p==0)
        {
            while(l<r&&get(i,d[r])*get2(d[r],d[r-1])>=get(d[r],d[r-1])*get2(i,d[r])) r--; 
            d[++r]=i;
        }
        else
        {
            int x=1,y=r-1,wz=0;
            while(x+1<y)
            {
                int mid=(x+y)/2;
                if(get(d[mid+1],d[mid])>=-a1[i].s*get2(d[mid+1],d[mid])) x=mid;
                else y=mid;
            }
            if(get(d[y+1],d[y])>=-a1[i].s*get2(d[y+1],d[y])) wz=d[y+1];
            else if(get(d[y],d[x])>=-a1[i].s*get2(d[y],d[x])) wz=d[y];
            else wz=d[x];
            ans[a1[i].p]=max(ans[a1[i].p],a1[wz].s-abs(a1[wz].w-a1[i].w)*a1[i].s);
        }
    }
    l=1,r=0;
    fod(i,n+m,1)
    {
        if(a1[i].p==0)
        {
            while(l<r&&get(i,d[r])*get2(d[r],d[r-1])<=get(d[r],d[r-1])*get2(i,d[r])) r--; 
            d[++r]=i;
        }
        else
        {
            int x=1,y=r-1,wz=0;
            while(x+1<y)
            {
                int mid=(x+y)/2;
                if(get(d[mid],d[mid+1])<=a1[i].s*get2(d[mid],d[mid+1])) x=mid;
                else y=mid;
            }
            y=max(y,x);
            if(y<r&&get(d[y],d[y+1])<=a1[i].s*get2(d[y],d[y+1])) wz=d[y+1];
            else if(get(d[x],d[y])<=a1[i].s*get2(d[x],d[y])) wz=d[y];
            else wz=d[x];
            ans[a1[i].p]=max(ans[a1[i].p],a1[wz].s-abs(a1[wz].w-a1[i].w)*a1[i].s);
        }
    }
    fo(i,1,m) printf("%lld\n",ans[i]);
}