开车旅行 NOIP 2012 提高组D1T3

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M=100010;
struct node{
	int h,num;
}city[M];
struct func{
	ll x,y;
};
int n,l[M],r[M],rem[M],near1[M],near2[M],city_h[M],f[M][30];
ll dis[M][30][2];
int cmp(node q,node p){
	return q.h<p.h;
}
func find(int i,int x0){
	int m=0;
	while(f[i][m+1]!=-1&&dis[i][m+1][0]+dis[i][m+1][1]<=x0)m++;
	if(i==n||f[i][m]==-1||dis[i][m][0]+dis[i][m][1]>x0){
		func p;
		if(near2[i]==0||abs(city_h[i]-city_h[near2[i]])>x0){
			p.x=0;
			p.y=0;
		}
		else{
			p.x=abs(city_h[i]-city_h[near2[i]]);
			p.y=0;
		}
		return p;
	}
	func p=find(f[i][m],x0-dis[i][m][0]-dis[i][m][1]);
	p.x+=dis[i][m][0];
	p.y+=dis[i][m][1];
	return p;
}
int main(){
	int m,i,j,l1,l2,r1,r2,s0,x0,ans,now,l1_dis,l2_dis,r1_dis,r2_dis;
	double cc,dd=1e9;
	func p;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%d",&city[i].h);
		city_h[i]=city[i].h;
		city[i].num=i;
	}
	sort(city+1,city+1+n,cmp);
	for(i=1;i<=n;i++){
		rem[city[i].num]=i;
		l[i]=i-1;
		r[i]=i+1;
	}
	r[n]=0;
	city[0].h=0x3f3f3f3f;
	for(i=1;i<=n;i++){
		now=rem[i];
		l1=l[now];
		l2=l[l[now]];
		r1=r[now];
		r2=r[r[now]];
		l1_dis=abs(city[l1].h-city[now].h);
		l2_dis=abs(city[l2].h-city[now].h);
		r1_dis=abs(city[r1].h-city[now].h);
		r2_dis=abs(city[r2].h-city[now].h);
		if(l1_dis<r1_dis||l1_dis==r1_dis&&city[l1].h<city[r1].h){
			near1[i]=city[l1].num;
			if(r1_dis<l2_dis||r1_dis==l2_dis&&city[r1].h<city[l2].h)
				near2[i]=city[r1].num;
			else near2[i]=city[l2].num;
		}
		else{
			near1[i]=city[r1].num;
			if(l1_dis<r2_dis||l1_dis==r2_dis&&city[l1].h<city[r2].h)
				near2[i]=city[l1].num;
			else near2[i]=city[r2].num;
		}
		if(l1)r[l1]=r[now];
		if(r1)l[r1]=l[now];
	}
	scanf("%d",&x0);
	near1[0]=0;
	near2[0]=0;
	memset(f,-1,sizeof(f));
	for(i=1;i<=n;i++)
		if(near1[near2[i]]){
			f[i][0]=near1[near2[i]];
			dis[i][0][0]=abs(city_h[i]-city_h[near2[i]]);
			dis[i][0][1]=abs(city_h[near2[i]]-city_h[near1[near2[i]]]);
		}
	for(j=1;(1<<j)<n;j++)
		for(i=1;i<=n;i++)
			if(f[i][j-1]!=-1&&f[f[i][j-1]][j-1]!=-1){
				f[i][j]=f[f[i][j-1]][j-1];
				dis[i][j][0]=dis[i][j-1][0]+dis[f[i][j-1]][j-1][0];
				dis[i][j][1]=dis[i][j-1][1]+dis[f[i][j-1]][j-1][1];
			}
	for(i=1;i<=n;i++){
		p=find(i,x0);
		if(p.y==0)cc=1e10;
		else cc=p.x*1./p.y;
		if(cc<dd){
			dd=cc;
			ans=i;
		}
	}
	printf("%d\n",ans);
	scanf("%d",&m);
	while(m--){
		scanf("%d%d",&s0,&x0);
		p=find(s0,x0);
		printf("%lld %lld\n",p.x,p.y);
	}
	return 0;
}