P2698 [USACO12MAR]花盆Flowerpot（单调队列+二分）

P2698 [USACO12MAR]花盆Flowerpot

一看标签........十分后悔

标签告诉你单调队列+二分了............

每次二分花盆长度，蓝后开2个单调队列维护最大最小值

蓝后就是code了

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
inline int Max(int a,int b){return a>b?a:b;}
void read(int &x){static char c=getchar();x=0;while(c<'0'||c>'9') c=getchar();while('0'<=c&&c<='9') x=x*10+(c^48),c=getchar();
}
#define N 100005
struct data{int x,y;}a[N];
inline bool cmp(data A,data B){return A.x<B.x;}
int n,d,h1[N],h2[N],L1,R1,L2,R2;
bool check(int len){int re=0; L1=L2=1; R1=R2=0;for(int i=1;i<=n;++i){while(L1<=R1&&a[h1[L1]].x<a[i].x-len) ++L1;while(L2<=R2&&a[h2[L2]].x<a[i].x-len) ++L2;while(L1<=R1&&a[h1[R1]].y>=a[i].y) --R1;while(L2<=R2&&a[h2[R2]].y<=a[i].y) --R2;h1[++R1]=h2[++R2]=i;re=Max(re,a[h2[L2]].y-a[h1[L1]].y);}return re<d;
}
int main(){read(n);read(d);for(int i=1;i<=n;++i) read(a[i].x),read(a[i].y);sort(a+1,a+n+1,cmp);int l=1,r=1000000;while(l<r){int mid=(l+r)>>1;if(check(mid)) l=mid+1;else r=mid;}if(check(l)) puts("-1");else printf("%d",l);return 0;
}

转载于:https://www.cnblogs.com/kafuuchino/p/10581123.html

P2698 [USACO12MAR]花盆Flowerpot（单调队列+二分）相关推荐

洛谷 P2698 [USACO12MAR]花盆Flowerpot 单调队列
https://www.luogu.org/problemnew/show/P2698 题意中文的不说了: 做法:就是一个滑动区间维护最大值和最小值,首先,了解一条性质,对于满足要求的两个区间 (l1 ...
P2698 [USACO12MAR]花盆Flowerpot 单调队列
https://www.luogu.org/problemnew/show/P2698 警示用数组写双端队列的话,记得le = 1, ri = 0: le<=ri表示队列非空题意求一个最小 ...
luogu 2698 [USACO12MAR]花盆Flowerpot 单调队列
刷水~ Code: #include<bits/stdc++.h> using namespace std; #define setIO(s) freopen(s".in&quo ...
洛谷P2698 [USACO12MAR]花盆Flowerpot
P2698 [USACO12MAR]花盆Flowerpot 题目描述 Farmer John has been having trouble making his plants grow, and n ...
[洛谷P2698] [USACO12MAR]花盆Flowerpot
洛谷题目链接:[USACO12MAR]花盆Flowerpot 题目描述 Farmer John has been having trouble making his plants grow, and ...
luogu P2698 [USACO12MAR]花盆Flowerpot
背景: 集训Day3Day3Day3,单调队列开启. 其实原来就会,但是好像没做几题(除了斜率优化的). 打算用111至222天做一些题(太菜,大佬勿喷). rank=20000+rank=20000 ...
洛谷 P2698 [USACO12MAR]花盆Flowerpot（抄）
题目描述 Farmer John has been having trouble making his plants grow, and needs your help to water them p ...
P2698 [USACO12MAR]花盆Flowerpot
传送门看到求最小,考虑二分答案发现二分答案后直接搞两个单调队列维护最大最小值就好了然后就没有然后了话说这题也可以用尺取法动态维护左右区间$O(n)$过... #include<iostr ...
[P2698][USACO12MAR]花盆Flowerpot
Link: P2698 传送门 Solution: 对于可行区间$[L,R]$,随着$L$的递增$R$不会递减因此可以使用尺取法来解决此题:不断向右移动左右指针,复杂度保持线性同时为了维护区间内的 ...

P2698 [USACO12MAR]花盆Flowerpot（单调队列+二分）

P2698 [USACO12MAR]花盆Flowerpot（单调队列+二分）相关推荐

最新文章

热门文章