[几何 扫描线 最大子段和] JOI Open Contest 2017 Bulldozer

题目大意：给出平面上n个带权点，有正有负，求平面上两条平行直线之间的点权和最大是多少
VIEW PROBLEM - BULLDOZER (JOI17_BULLDOZER)

直接枚举斜率，点按照距离排序后是一个最大子段和问题
然后考虑扫描线旋转斜率，两个点相对关系变化只会发生在斜率与两点连线平行的情况，那么两点位置swap一下，更一般的如果是一段都满足这个，那么这一段要reverse一下
就是把两点间连线按照斜率排一下，搞个线段树维护下最大子段和

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=2005;

ll S[N<<2],L[N<<2],R[N<<2],F[N<<2];
int pos[N];
inline void upd(int x){
  S[x]=S[x<<1]+S[x<<1|1];
  L[x]=max(L[x<<1],L[x<<1|1]+S[x<<1]);
  R[x]=max(R[x<<1|1],R[x<<1]+S[x<<1|1]);
  F[x]=max(max(F[x<<1],F[x<<1|1]),R[x<<1]+L[x<<1|1]);
}
inline void Build(int x,int l,int r,int *a){
  if (l==r){
    pos[l]=x;
    S[x]=a[l]; L[x]=R[x]=F[x]=max(a[l],0);
    return;
  }
  int mid=(l+r)>>1; Build(x<<1,l,mid,a); Build(x<<1|1,mid+1,r,a);
  upd(x);
}
inline void Modify(int x,int a){
  x=pos[x];
  S[x]=a; L[x]=R[x]=F[x]=max(a,0);
  while (x>>=1)
    upd(x);
}

int n,x[N],y[N],w[N];
int a[N],back[N],idx[N];

ll X,Y;

inline void Pre(){
  while (1){
    X=rand()+1,Y=-(rand()+1);
    int flag=0;
    for (int i=1;i<=n && !flag;i++)
      for (int j=1;j<i && !flag;j++)
    flag|=(y[i]-y[j])*X-(x[i]-x[j])*Y==0;
    if (!flag) break;
  }
}

struct event{
  int a,b;
  bool operator < (const event &B) const{
    return (ll)(y[B.a]-y[B.b])*(x[a]-x[b])-(ll)(y[a]-y[b])*(x[B.a]-x[B.b])>0;
  }
  friend bool jud(event A,event B){
    return (ll)(y[A.a]-y[A.b])*(x[B.a]-x[B.b])==(ll)(y[B.a]-y[B.b])*(x[A.a]-x[A.b]);
  }
}ev[N*N]; int tot;


inline ll dis(int i){
  return x[i]*Y-y[i]*X;
}
inline bool cmp(int x,int y){
  return dis(x)<dis(y);
}

int vst[N],clk;
inline void add(int x,int y){
  if (x+1==y) vst[x]=clk;
  if (y+1==x) vst[y]=clk;
}

inline void modify(int x){
  if (vst[x]==clk) return;
  int l=x; while (l-1 && vst[l-1]==clk-1) l--;
  int r=x; while (r+1<=n && vst[r]==clk-1) r++;
  for (int i=l;i<=r;i++)
    Modify(i,a[l+r-i]),vst[i]=clk;
  reverse(a+l,a+r+1); reverse(idx+l,idx+r+1);
  for (int i=l;i<=r;i++) back[idx[i]]=i;
}

int main(){
  //freopen("t.in","r",stdin);
  //freopen("t.out","w",stdout);
  read(n);
  for (int i=1;i<=n;i++) read(x[i]),read(y[i]),read(w[i]);
  Pre();
  for (int i=1;i<=n;i++) idx[i]=i;
  sort(idx+1,idx+n+1,cmp); reverse(idx+1,idx+n+1);
  for (int i=1;i<=n;i++) a[i]=w[idx[i]],back[idx[i]]=i;
  Build(1,1,n,a);
  ll Ans=F[1];
  for (int i=1;i<=n;i++)
    for (int j=1;j<i;j++)
      if (X*(y[j]-y[i])-Y*(x[j]-x[i])>0)
    ev[++tot].a=j,ev[tot].b=i;
      else
    ev[++tot].a=i,ev[tot].b=j;
  sort(ev+1,ev+tot+1);
  for (int i=1,j;i<=tot;i=j+1){
    ++clk;
    j=i; add(back[ev[j].a],back[ev[j].b]);
    while (j+1<=tot &&  jud(ev[j+1],ev[i]))
      j++,add(back[ev[j].a],back[ev[j].b]);
    ++clk;
    for (int k=i;k<=j;k++)
      modify(back[ev[k].a]);
    Ans=max(Ans,F[1]);
  }
  printf("%lld\n",Ans);
  return 0;
}