【USACO 18 FEB】Snow Boots

【题目】

传送门

题目描述：

It’s winter on the farm, and that means snow! There are NN tiles on the path from the farmhouse to the barn, conveniently numbered $1\dots n$, and tile i is covered in $f_i$ feet of snow. In his farmhouse cellar, Farmer John has b pairs of boots, numbered $1\dots b$. Some pairs are more heavy-duty than others, and some pairs are more agile than others. In particular, pair i lets FJ step in snow at most $s_i$ feet deep, and lets FJ move at most $d_i$ forward in each step.

Farmer John starts off on tile 1 and must reach tile $n$ to wake up the cows. Tile 1 is sheltered by the farmhouse roof, and tile $n$ is sheltered by the barn roof, so neither of these tiles has any snow. Help Farmer John determine which pairs of snow boots will allow him to make the trek.

输入格式：

The first line contains two space-separated integers $n$ and $b$ ($1\le n,b\le 10^5$). The second line contains $n$ space-separated integers; the ith integer is $f_i$ , the depth of snow on tile i ($0\le f_i\le 10^9$). It’s guaranteed that $f_1=f_n=0$.

The next $b$ lines contain two space-separated integers each. The first integer on line $i+2$ is $s_i$, the maximum depth of snow in which pair i can step. The second integer on line $i+2$ is $d_i$, the maximum step size for pair i. It’s guaranteed that $0\le s_i\le 10^9$ and $1\le d_i\le n-1$.

输出格式：

The output should consist of b lines. Line i should contain a single integer: 1 if Farmer John can trek from tile 1 to tile n wearing the ith pair of boots, and 0 otherwise.

样例数据：

输入
8 7
0 3 8 5 6 9 0 0
0 5
0 6
6 2
8 1
10 1
5 3
150 7

输出
0
1
1
0
1
1
1

【分析】

翻译就去洛谷上看吧，还是很清楚的

这道题有很多种解法啊，我用的是线段树

对于靴子 $i$ ，我们将它能走的地方设为 $1$，不能走的地方设为 $0$ ，那么区间最长的连续的 $0$ 的长度与 $d_i$ 相比就能得出答案，即如果这个值小于 $d_i$，那么答案为 $1$；否则答案为 $0$

维护区间最长 $0$ 的长度可以用线段树轻松解决，主要是怎么确定各个位置上是 $0$ 还是 $1$ 的问题

如果是每次枚举一只靴子都在线段树上找一遍来确定 $0,1$，那么总复杂度会是 $n^2{\log }_{2}n$ 的，显然不能通过

考虑先将线段树赋为全 $0$（都不能走），把雪和靴子按照雪的深度排序，从小到大开始扫描。如果扫到雪，则在线段树中把这块雪的位置改为 $1$（因为以后扫到的靴子能承受的积雪深度都不小于这块地砖的积雪深度，也就是都能走这块雪）；如果扫到靴子，就统计最长连续的不能走的那段雪的数量，计算答案

线段树单点修改是 $O({\log }_{2}n)$ 的，查询最长连续 $0$ 的时间复杂度则是$O(1)$，总时间复杂度：$O(n{\log }_{2}n)$

【代码】

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 100005
using namespace std;
int n,b,ans[N];
struct snow{int s,d,op,id;}a[N<<1];
struct Tree{int L,R,num,len;}Seg[N<<4];
bool comp(const snow &p,const snow &q){return (p.s==q.s)?p.op<q.op:p.s<q.s;}
Tree pushup(Tree left,Tree right)
{
	Tree now;
	now.len=left.len+right.len;
	now.L=(left.L==left.len)?left.L+right.L:left.L;
	now.R=(right.R==right.len)?right.R+left.R:right.R;
	now.num=max(max(left.num,right.num),right.L+left.R);
	return now;
}
void build(int root,int l,int r)
{
	if(l==r)
	{
		Seg[root].L=Seg[root].R=Seg[root].num=Seg[root].len=1;
		return;
	}
	int mid=(l+r)>>1;
	build(root<<1,l,mid);
	build(root<<1|1,mid+1,r);
	Seg[root]=pushup(Seg[root<<1],Seg[root<<1|1]);
}
void modify(int root,int l,int r,int x)
{
	if(l==r)
	{
		Seg[root].L=Seg[root].R=Seg[root].num=0;
		return;
	}
	int mid=(l+r)>>1;
	if(x<=mid)  modify(root<<1,l,mid,x);
	else  modify(root<<1|1,mid+1,r,x);
	Seg[root]=pushup(Seg[root<<1],Seg[root<<1|1]);
}
int main()
{
	int n,b,i;
	scanf("%d%d",&n,&b);
	for(i=1;i<=n;++i)  scanf("%d",&a[i].s),a[i].op=0,a[i].id=i;
	for(i=1;i<=b;++i)  scanf("%d%d",&a[n+i].s,&a[n+i].d),a[n+i].op=1,a[n+i].id=i;
	sort(a+1,a+n+b+1,comp);
	build(1,1,n);
	for(i=1;i<=n+b;++i)
	{
		if(!a[i].op)  modify(1,1,n,a[i].id);
		else  ans[a[i].id]=(Seg[1].num+1<=a[i].d)?1:0;
	}
	for(i=1;i<=b;++i)
	  printf("%d\n",ans[i]);
	return 0;
}