5-14 数据结构啊poi Q.购票

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=78124#problem/Q

//想看题目的@willinglive

嗯...你们知道是哪题

CDQ分治+点分治+斜率优化

http://blog.youkuaiyun.com/lqybzx/article/details/44985805

题解在这里...

#include<cstdio>
#include<algorithm>
using namespace std;
struct city
{
     long long f,s,p,q,l;
}p[1000001];
struct line
{
     int s,t;
     long long x;
     int next;
     bool flag;
}a[2000001];
int head[1000001];
int edge;
inline void add(int s,int t,long long x)
{
     a[edge].next=head[s];
     head[s]=edge;
     a[edge].s=s;
     a[edge].t=t;
     a[edge].x=x;
     a[edge].flag=true;
}
long long dis[1000001];
int len[1000001];
int dep[1000001],son[1000001],mson[1000001];
int ans[1000001][22];
long long anc[1000001][22];
long long f[1000001];
inline bool cmp(int x,int y)
{
     if(dep[len[x]]>dep[len[y]])
          return true;
     return false;
}
inline void dfs1(int d)
{
     int i,j;
     for(i=head[d];i!=0;i=a[i].next)
     {
          int t=a[i].t;
          dis[t]=dis[d]+a[i].x;
          dep[t]=dep[d]+1;
          ans[t][0]=d;
          anc[t][0]=a[i].x;
          for(j=1;j<=21;j++)
          {
               ans[t][j]=ans[ans[t][j-1]][j-1];
               anc[t][j]=anc[ans[t][j-1]][j-1]+anc[t][j-1];
          }
          dfs1(t);
     }
}
int minx,mini;
inline void find(int d,int s)
{
	 son[d]=0;
	 mson[d]=0;
     int i;
     for(i=head[d];i!=0;i=a[i].next)
     {
          if(a[i].flag)
          {
               int t=a[i].t;
               find(t,s);
               son[d]+=son[t]+1;
               mson[d]=max(mson[d],son[t]+1);
          }
     }
     int tmp=max(mson[d],s-mson[d]-1);
     if(tmp<minx)
     {
          minx=tmp;
          mini=d;
     }
}
int ps;
int px[1000001];
inline void gets(int d)
{
	 int i;
     for(i=head[d];i!=0;i=a[i].next)
     {
     	  if(a[i].flag)
     	  {
               int t=a[i].t;
               ps++;
               px[ps]=t;
               gets(t);
          }
     }
}
int q[1000001];
struct save
{
	 int x;
     long long f;
     long long dis;
     double k;
};
inline double getk(int k,int j)
{
     return double(f[j]-f[k])/double(dis[j]-dis[k]);
}
inline void solve(int d,int size,int zx)
{
	 if(size==1)
	      return ;
	 else if(size==2)
	 {
	      if(dep[len[zx]]<=dep[d])
	      {
	           if(f[zx]!=0)
                    f[zx]=min(f[zx],f[d]+(dis[zx]-dis[d])*p[zx].p+p[zx].q);
               else
                    f[zx]=f[d]+(dis[zx]-dis[d])*p[zx].p+p[zx].q;
          }
          return ;
	 }
     int i;
     int ttx=son[zx];
     son[d]-=son[zx];
     for(i=head[zx];i!=0;i=a[i].next)
          a[i].flag=false;
     minx=2100000000;
     mini=0;
     find(d,son[d]+1);
     solve(d,son[d]+1,mini);
     for(i=head[zx];i!=0;i=a[i].next)
          a[i].flag=true;
     ps=0;
     ps++;
     px[ps]=zx;
     gets(zx);
     sort(px+1,px+1+ps,cmp);
     int dx=zx;
     int l=1,r=0,lt=1;
     while(dx!=p[d].f)
     {
          while(l<r&&getk(q[r-1],q[r])<getk(q[r],dx))
               r--;
          r++;
          q[r]=dx;
          while(dep[len[px[lt]]]>dep[dx])
               lt++;
          dx=p[dx].f;
          while(((dep[len[px[lt]]]==dep[q[r]])||(dep[len[px[lt]]]<dep[q[r]]&&dx==p[d].f))&<<=ps)
          {
               int ll=l+1,rr=r;
               while(ll<=rr)
               {
                    int mid=(ll+rr)/2;
                    if(getk(q[mid-1],q[mid])>p[px[lt]].p)
                         ll=mid+1;
                    else
                         rr=mid-1;
               }
               if(f[px[lt]]!=0)
                    f[px[lt]]=min(f[px[lt]],f[q[rr]]+(dis[px[lt]]-dis[q[rr]])*p[px[lt]].p+p[px[lt]].q);
               else
                    f[px[lt]]=f[q[rr]]+(dis[px[lt]]-dis[q[rr]])*p[px[lt]].p+p[px[lt]].q;
               lt++;
               if(lt>ps)
                    break;
          }
     	//此处是没有推出公式的斜率优化dp , 
     	//动态维护凸包(-dis,f)
     	//-dis是单调的...... 
     	
     }
     find(zx,ttx+1);
     for(i=head[zx];i!=0;i=a[i].next)
     {
     	  int t=a[i].t;
          minx=2100000000;
          mini=0;
     	  find(t,son[t]+1);
          solve(t,son[t]+1,mini);
     }
}
int main()
{
//     freopen("test.in","r",stdin);
  //   freopen("test.out","w",stdout);
     int n,t;
     scanf("%d%d",&n,&t);
     int i,j;
     for(i=2;i<=n;i++)
     {
          scanf("%lld%lld%lld%lld%lld",&p[i].f,&p[i].s,&p[i].p,&p[i].q,&p[i].l);
          edge++;
          add(p[i].f,i,p[i].s);
     }
     dis[1]=0;
     dep[1]=1;
     dfs1(1);
     long long dx;
     int d;
     for(i=1;i<=n;i++)
     {
          j=21;
          dx=0;
          d=i;
          while(j>=0)
          {
               if(dx+anc[d][j]<=p[i].l)
               {
                    dx+=anc[d][j];
                    d=ans[d][j];
               }
               j--;
          }
          len[i]=d;
     }
     minx=2100000000;
     mini=0;
     find(1,n);
     solve(1,n,mini);
     for(i=2;i<=n;i++)
	      printf("%lld\n",f[i]);
     return 0;
}