#链表，倍增优化dp#洛谷 1081 JZOJ 3101 开车旅行

题目链接

---

分析

首先要预处理出最小点和次小点，这一点要用链表完成，然后倍增处理出第$i$个点出发小A、B每天轮流开车$2^j$所到的点，小A行驶的距离和小B行驶的距离，，然后每个询问我们用这些预处理去拼凑答案，注意小A还可以再走一步，说着容易做着难，所以详见代码吧

---

代码

#include <cstdio>
#include <cctype>
#include <algorithm>
#define rr register
#define abs(x) ((x)<0?-(x):(x))
using namespace std;
struct liSt{int v,rk,l,r;}a[100001];
typedef long long ll;
int n,rrk[100001],na[100001],nb[100001],dp[100001][17],fa[100001][17],fb[100001][17],ans,bns;
inline ll iut(){
	rr ll ans=0,f=1; rr char c=getchar();
	while (!isdigit(c)) f=(c=='-')?-f:f,c=getchar();
	while (isdigit(c)) ans=(ans<<3)+(ans<<1)+(c^48),c=getchar();
	return ans*f;
}
inline bool lef(int t,int l,int r){
	if (!l) return 0;
	if (!r) return 1;
	return a[t].v-a[l].v<=a[r].v-a[t].v;
}
inline signed pd(int t,int l,int r){
	if (!l) return a[r].rk;
	if (!r) return a[l].rk;
	if (a[t].v-a[l].v<=a[r].v-a[t].v) return a[l].rk;
	    else return a[r].rk;
}
inline void answ(ll x,int root){
	ans=bns=0;
	for (rr int i=16;~i;--i)
	if (dp[root][i]&&ans+bns+fa[root][i]+fb[root][i]<=x)
		ans+=fa[root][i],bns+=fb[root][i],root=dp[root][i];
	if (na[root]&&ans+bns+fa[root][0]<=x) ans+=fa[root][0];
}
inline void print(int ans){
	if (ans>9) print(ans/10);
	putchar(ans%10+48);
}
bool cmp(liSt x,liSt y){return x.v<y.v;}
signed main(){
	n=iut();
	for (rr int i=1;i<=n;++i) a[i]=(liSt){iut(),i};
	sort(a+1,a+1+n,cmp);
	for (rr int i=1;i<=n;++i) rrk[a[i].rk]=i,a[i].l=i-1,a[i].r=i+1; a[n].r=0;
	for (rr int i=1;i<=n;++i){
	    rr int t=rrk[i],l=a[t].l,r=a[t].r;
		if (lef(t,l,r)) nb[i]=a[l].rk,na[i]=pd(t,a[l].l,r);
		    else nb[i]=a[r].rk,na[i]=pd(t,l,a[r].r);
		if (l) a[l].r=r; if (r) a[r].l=l;
	}
	for (rr int i=1;i<=n;++i){
		dp[i][0]=nb[na[i]];
		fa[i][0]=abs(a[rrk[i]].v-a[rrk[na[i]]].v);
		fb[i][0]=abs(a[rrk[dp[i][0]]].v-a[rrk[na[i]]].v);
	}
	for (rr int j=1;j<17;++j)
	for (rr int i=1;i<=n;++i)
	dp[i][j]=dp[dp[i][j-1]][j-1],
	fa[i][j]=fa[i][j-1]+fa[dp[i][j-1]][j-1],
	fb[i][j]=fb[i][j-1]+fb[dp[i][j-1]][j-1];
	rr ll x=iut(),poi; rr double minn=2147483647;
	for (rr int i=1;i<=n;++i){
		answ(x,i);
		if (bns&&1.0*ans/bns<minn)
		    minn=1.0*ans/bns,poi=i;
	}
	print(poi),putchar(10);
	for (rr int m=iut();m;--m){
		rr int t=iut();
		answ(iut(),t);
		print(ans),putchar(32),
		print(bns),putchar(10);
	}
	return 0;
}